Compiling Scheme into a Cellular Automata

This is will enormously speed up computing: Compile Scheme into a CA. Such a compiler if designed properly could parallelize recursive code from the grass roots. The immense parallel nature will reduce the actual time of execution and might make ab-initio protein folding feasible on machines without relying on quantum computing.

First step in writing a Scheme-to-CA compiler would be to define the \lambda. Then define Church numerals. Then define the Y combinator as a CA structure that reproduces itself in a particular dimension if necessary. Then define the primitives: car, cdr, zero?, null?, cond, etc in CA so as to break the meta circularity easily. Thats it! You are good to go baby!

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s