Finite combinatory processes—formulation 1 (1936)

E1754075 UNEXPLORED

Finite combinatory processes—formulation 1 (1936) is Emil Post’s seminal paper that introduced a formal model of computation equivalent to Turing machines, helping to lay the foundations of computability theory.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Finite combinatory processes—formulation 1 (1936) canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Emil Post → notableWork → Finite combinatory processes—formulation 1 (1936) ⓘ