Difference between revisions of "Decider Tiler"
(Created page with "{{SoftwareTemplate |Name=Decider Tiler |Description=The Decider Tiler is a Win32 command line tool that produces a template for a Turing machine definition and then takes the co...") |
|||
| Line 1: | Line 1: | ||
{{SoftwareTemplate | {{SoftwareTemplate | ||
|Name=Decider Tiler | |Name=Decider Tiler | ||
| − | |Description=The Decider Tiler is a Win32 command line tool that produces a template for a Turing machine definition and then takes the completed TM definition as input and outputs a tileset and seed that will self-assemble into an assembly that performs the computation of that TM on every natural number, sequentially. The language of the Turing machine must be decidable, and simulation will result in the weak self-assembly of a canonical two-dimensional representation of the language as a set of 'ACCEPT' tiles along either the positive x-axis or the negative y-axis, depending on the command line arguments used. See "Self-Assembly of Decidable Sets" by Patitz and Summers for a detailed description. | + | |Description=The Decider Tiler is a Win32 command line tool (the package also contains the source code) that produces a template for a Turing machine definition and then takes the completed TM definition as input and outputs a tileset and seed that will self-assemble into an assembly that performs the computation of that TM on every natural number, sequentially. The language of the Turing machine must be decidable, and simulation will result in the weak self-assembly of a canonical two-dimensional representation of the language as a set of 'ACCEPT' tiles along either the positive x-axis or the negative y-axis, depending on the command line arguments used. See "Self-Assembly of Decidable Sets" by Patitz and Summers for a detailed description. |
|Download=DeciderTiler.zip | |Download=DeciderTiler.zip | ||
}} | }} | ||
Latest revision as of 13:12, 28 August 2013
Name
Decider Tiler
Description
The Decider Tiler is a Win32 command line tool (the package also contains the source code) that produces a template for a Turing machine definition and then takes the completed TM definition as input and outputs a tileset and seed that will self-assemble into an assembly that performs the computation of that TM on every natural number, sequentially. The language of the Turing machine must be decidable, and simulation will result in the weak self-assembly of a canonical two-dimensional representation of the language as a set of 'ACCEPT' tiles along either the positive x-axis or the negative y-axis, depending on the command line arguments used. See "Self-Assembly of Decidable Sets" by Patitz and Summers for a detailed description.
