Bazsites.com Turing Machines

Directory Topics

Turing Machines - Examples of Turing machines, the Church-Turing thesis and a discussion of uncomputability.
Recursively Enumerable Language - A Wikipedia article which defines Turing machines, gives examples and describes equivalent models and the universal Turing machine.
Turing Machines and Computability - A discussion of decision problems, Turing machines, noncomputable problems, Goedel numbering and the halting problem.
Turing Machine - Article on Turing Machines from the Stanford Encyclopedia.
Turing Machines and Effective Computability - This chapter gives a rigorous definition of an effective procedure and formal systems which capture this intuitive concept. It also discusses the Church-Turing thesis, the universal Turing machine and concepts such as computability, decidability and enumerability.
Turing Machines and Context Sensitive Grammars - A set of slides briefly describing Turing machine, the more restrictive linear bounded automata and an example of construction of a context sensitive grammar.
Turing Machine Languages - This article shows the relation between recursively enumerable languages and Turing machines.
Turing Machine - Article on Turing Machines from the Stanford Encyclopedia.
Turing Machines - Article in Stanford Encyclopedia of Philosophy.
Turing Machines and Universes - Essay exploring Turing Machine theory from quantum mechanical and universal perspectives.

A Madman Dreams of Turing Machines - A Madman Dreams of Turing Machines is a book by Janna Levin which contrasts the lives and ideas of Kurt Gödel and Alan Turing (who never met).
Alan Turing's Unorganized Machines - In a far-sighted 1948 report Alan Turing suggested that the infant human cortex was what he called an unorganized machineTuring's 1948 paper has been re-printed as Turing AM. Intelligent Machinery.
Read only right moving Turing Machines - A particular type of Turing Machine. The definition based on a single infinite tape defined to be a 7-tuple
Zeno machine - In mathematics and computer science, Zeno machines (abbreviated ZM, and also called Accelerated Turing machine, ACM) are a hypothetical computational model related to Turing machines that allows a countably infinite number of algorithmic steps to be performed in finite time. These machines are ruled out in most models of computation.
Turing machine - Turing machines are extremely basic abstract symbol-manipulating devices which, despite their simplicity, can be adapted to simulate the logic of any computer that could possibly be constructed. They were described in 1936 by Alan Turing.