Finite combinatory processes—formulation

DOI10.2307/2269031MaRDI QIDQ5764179zbMATH OpenOpenAlexWikidataFDO

Authors Emil Leon Post

Publication date 1936

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2269031

zbMATH Keywords

Foundations, philosophy, logic

Cites work

• An Unsolvable Problem of Elementary Number Theory

Cited in

(20)

• Building a model of a useful Turing machine
• Processing natural language with biomolecules: where linguistics, biology and computation meet
• When Logic Meets Engineering: Introduction to Logical Issues in the History and Philosophy of Computer Science
• A vindication of program verification
• Remarks on the development of computability
• Closing the Circle: An Analysis of Emil Post's Early Work
• Mathematical roots of phenomenology: Husserl and the concept of number
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• Step by Recursive Step: Church's Analysis of Effective Calculability
• Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic
• Mathematical and technological computability
• Introduction to the \textit{Zambelli Festschrift}
• What is the Church-Turing Thesis?
• Computability and Recursion
• Should computations halt?
• Universal Turing Machine
• The origins of combinatorics on words
• Towards completeness: Husserl on theories of manifolds 1890--1901
• On mind \& Turing's machines
• Superefficiency from the vantage point of computability

This page was built for publication: Finite combinatory processes—formulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5764179)