Stephen Wolfram's: A New Kind of Science | Online
Jump to Page
Look Up in Index
Search

Chapter 3 Notes > Section 4 > Page 888 > Note (c) Previous note-----Next note
Notes for: The World of Simple Programs | Turing Machines


*Numbering scheme [for Turing machines]

One can number Turing machines and get their rules using

Flatten[MapIndexed[{1, -1} #2 + {0, k} -> {1, 1, 2}
Mod[Quotient[#1, {2k, 2, 1}], {s, k, 2}] + {1, 0, -1} &,
Partition[IntegerDigits[n, 2 s k, s k], k], {2}]]

The examples on page 79 have numbers 3024, 982, 925, 1971, 2506 and 1953.





PAGE IMAGE

Page image

RELATED LINKS

Pages related to this note:

*

All notes on this page:

* Implementation of generalized mobile automata
* Implementation [of Turing machines]
* Number of [Turing machine] rules
* Numbering scheme [for Turing machines]
* Counter [Turing] machine
* Distribution of behavior [in Turing machines]
* Head motion [in Turing machines]
* Localized structures [in Turing machines]
* All notes for this section
* Downloadable programs for this page
* Downloadable images
* Search Forum for this page
* Post a comment
* NKS | Online FAQs
From Stephen Wolfram: A New Kind of Science [citation] Previous note-----Next note