In computer science, a turmite is a two-dimensional Turing machine which has a current state, and a "tape" that consists of an infinite grid with labelled cells, nodes or edges. Computer science (or computing science) is the study and the Science of the theoretical foundations of Information and Computation and their Turing machines are basic abstract symbol-manipulating devices which despite their simplicity can be adapted to simulate the logic of any Computer Algorithm The terms ant and vant are also used. Langton's ant is a well-known type of turmite defined on the cells of a square grid. Langton's ant is a two-dimensional Turing machine with a very simple set of rules but complicated emergent behavior Paterson's worms are a type of turmite defined on the edges of an isometric grid.
It has been shown that turmites in general are exactly equivalent in power to one-dimensional Turing machines with an infinite tape, as either can simulate the other.
External links
- Math Games: 2D Turing Machines, at MAA Online
- Math Games: Paterson's Worms Revisited, at MAA Online
- Turmite, at MathWorld. MathWorld is an online Mathematics reference work created and largely written by Eric W
Dapyx Software network: MP3 Explorer | Ebook Manager | Zenithic