Abstract
In this lecture and the next we take a brief look at some of the other traditional formalisms that are computationally equivalent to Turing machines. Each one of these formalisms embodies a notion of computation in one form or another, and each can simulate the others. In addition to Turing machines, we’ll consider
-
Post systems;
-
type 0 grammars;
-
μ-recursive functions (μ = “mu”, Greek for m);
-
λ-calculus (λ = “lambda”, Greek for l);
-
combinatory logic; and
-
while programs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kozen, D.C. (1997). Other Formalisms. In: Automata and Computability. Undergraduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1844-9_44
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1844-9_44
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7309-7
Online ISBN: 978-1-4612-1844-9
eBook Packages: Springer Book Archive