Pages that link to "Item:Q5760328"

The following pages link to An Unsolvable Problem of Elementary Number Theory (Q5760328):

Displaying 50 items.

• On the complex behavior of simple tag systems -- an experimental approach (Q616497) (← links)
• Computationalism, the Church-Turing thesis, and the Church-Turing fallacy (Q882835) (← links)
• Superefficiency from the vantage point of computability (Q900476) (← links)
• Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
• Uncomputability and undecidability in economic theory (Q1036534) (← links)
• The ontology of digital physics (Q1707215) (← links)
• Intensional computation with higher-order functions (Q1733061) (← links)
• On the number of unary-binary tree-like structures with restrictions on the unary height (Q1745901) (← links)
• Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract) (Q1798794) (← links)
• Formally computing with the non-computable (Q2117773) (← links)
• Péter on Church's thesis, constructivity and computers (Q2117808) (← links)
• Constructive mathematics, Church's thesis, and free choice sequences (Q2117809) (← links)
• Models of quantum computation and quantum programming languages (Q2250909) (← links)
• Cut-elimination for quantified conditional logic (Q2363418) (← links)
• The many forms of hypercomputation (Q2497883) (← links)
• Generating candidate busy beaver machines (or how to build the zany zoo) (Q2672601) (← links)
• 2011 North American Annual Meeting of the Association for Symbolic Logic (Q2893284) (← links)
• When Logic Meets Engineering: Introduction to Logical Issues in the History and Philosophy of Computer Science (Q2963950) (← links)
• The manuscripts of emil L. post (Q3033717) (← links)
• Information and computation: Classical and quantum aspects (Q3077099) (← links)
• A combinatory account of internal structure (Q3173527) (← links)
• On the Executability of Interactive Computation (Q3188271) (← links)
• Hierarchies of number-theoretic predicates (Q3226751) (← links)
• Degrees of Computability (Q3232282) (← links)
• Remarks on the development of computability (Q3310596) (← links)
• Husserl on the ‘Totality of all conceivable arithmetical operations’ (Q3429438) (← links)
• Closing the Circle: An Analysis of Emil Post's Early Work (Q3430940) (← links)
• Perfect nonlinear S-boxes on the real-line (Q3542564) (← links)
• A Natural Axiomatization of Computability and Proof of Church's Thesis (Q3616433) (← links)
• Alfred Tarski and undecidable theories (Q3764095) (← links)
• (Q3890137) (← links)
• The theory of recursive functions, approaching its centennial (Q3946156) (← links)
• Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers) (Q4049052) (← links)
• The work of Kurt Gödel (Q4140948) (← links)
• Recursively enumerable sets and degrees (Q4184825) (← links)
• Step by Recursive Step: Church's Analysis of Effective Calculability (Q4359525) (← links)
• Alonzo church:his life, his work and some of his miracles (Q4391354) (← links)
• Scanning the structure of ill‐known spaces: Part 1. Founding principles about mathematical constitution of space (Q4467041) (← links)
• On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups (Q4558123) (← links)
• What is a universal higher-order programming language? (Q4630303) (← links)
• Inductive learning and defeasible inference (Q4846731) (← links)
• Poincaré and the early history of 3-manifolds (Q4899978) (← links)
• Recursive Unsolvability of a problem of Thue (Q4919632) (← links)
• Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17–19, 1946), By Alfred Tarski (Q4953233) (← links)
• Mathematical and Technological Computability (Q4972862) (← links)
• Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer (Q4972864) (← links)
• Completeness: from Gödel to Henkin (Q4983362) (← links)
• (Q4991956) (← links)
• Encoding many-valued logic in $\lambda$-calculus (Q5009711) (← links)
• (Q5013873) (← links)