Pages that link to "Item:Q5764179"
From MaRDI portal
The following pages link to Finite combinatory processes—formulation (Q5764179):
Displayed 18 items.
- The origins of combinatorics on words (Q872058) (← links)
- Towards completeness: Husserl on theories of manifolds 1890--1901 (Q885542) (← links)
- On mind \& Turing's machines (Q885688) (← links)
- Superefficiency from the vantage point of computability (Q900476) (← links)
- Building a model of a useful Turing machine (Q1975337) (← links)
- Processing natural language with biomolecules: where linguistics, biology and computation meet (Q2104262) (← links)
- When Logic Meets Engineering: Introduction to Logical Issues in the History and Philosophy of Computer Science (Q2963950) (← links)
- A Vindication of Program Verification (Q2963953) (← links)
- Remarks on the development of computability (Q3310596) (← links)
- Closing the Circle: An Analysis of Emil Post's Early Work (Q3430940) (← links)
- Mathematical roots of phenomenology: Husserl and the concept of number (Q3439854) (← links)
- A Natural Axiomatization of Computability and Proof of Church's Thesis (Q3616433) (← links)
- Step by Recursive Step: Church's Analysis of Effective Calculability (Q4359525) (← links)
- Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic (Q4372922) (← links)
- Mathematical and Technological Computability (Q4972862) (← links)
- Introduction to the Zambelli Festschrift (Q5011342) (← links)
- What is the Church-Turing Thesis? (Q5055286) (← links)
- Computability and Recursion (Q5689263) (← links)