dataset · Wolfram Demonstrations Project · 2007

Turing Machine Enumeration

Cited by 0Open access

Abstract

A Turing machine with possible head states and possible tape colors faces possible situations Assuming the head can move in different locations where is most often 2 a Turing machine can produce outputs There are thus possible Turing machines of this sort This Demonstration shows the enumeration scheme used by Mathematica for describing onedimensional Turing machines The top portion of each of the

Cite this paper

APA 7

(2007). Turing Machine Enumeration. Wolfram Demonstrations Project. https://doi.org/10.3840/001552

MLA 9

“Turing Machine Enumeration.” Wolfram Demonstrations Project, 2007, https://doi.org/10.3840/001552.

Chicago

2007. “Turing Machine Enumeration.” Wolfram Demonstrations Project. https://doi.org/10.3840/001552.

Harvard

(2007) ‘Turing Machine Enumeration’, Wolfram Demonstrations Project. Available at: https://doi.org/10.3840/001552.

BibTeX

@misc{anon2007turing,
  title = {{Turing Machine Enumeration}},
  journal = {Wolfram Demonstrations Project},
  year = {2007},
  doi = {10.3840/001552}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.