Finite combinatory processes—formulation
From MaRDI portal
Publication:5764179
DOI10.2307/2269031zbMath0015.19301OpenAlexW2080280205WikidataQ55886419 ScholiaQ55886419MaRDI QIDQ5764179
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
Related Items
What is the Church-Turing Thesis?, 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, When Logic Meets Engineering: Introduction to Logical Issues in the History and Philosophy of Computer Science, A Vindication of Program Verification, Computability and Recursion, Step by Recursive Step: Church's Analysis of Effective Calculability, Building a model of a useful Turing machine, Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic, Remarks on the development of computability, A Natural Axiomatization of Computability and Proof of Church's Thesis, Mathematical and Technological Computability, Introduction to the Zambelli Festschrift, Closing the Circle: An Analysis of Emil Post's Early Work, Processing natural language with biomolecules: where linguistics, biology and computation meet, Mathematical roots of phenomenology: Husserl and the concept of number
Cites Work
