Turing machine

From HaskellWiki
Revision as of 22:00, 14 December 2024 by Atravers (talk | contribs) (Previous content moved to "Descriptions of Turing machines inspired by combinatory logic")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Haskell theoretical foundations

General:
Mathematics - Category theory
Research - Curry/Howard/Lambek

Lambda calculus:
Alpha conversion - Beta reduction
Eta conversion - Lambda abstraction

Other:
Recursion - Combinatory logic
Chaitin's construction - Turing machine
Relational algebra

The Turing machine is a formal mathematical system for describing the notion of computation. Almost all imperative programming languages have an ancestry based on the Turing machine.

For more information on the matter: Turing machine

Retrieved from "https://wiki.haskell.org/index.php?title=Turing_machine&oldid=66874"