The following pages link to Computability and Recursion (Q5689263):
Displaying 33 items.
- Syntactic structures and recursive devices: a legacy of imprecision (Q438595) (← links)
- Immunity properties and strong positive reducibilities (Q535145) (← links)
- The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
- Computation, hypercomputation, and physical science (Q959046) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
- Difference sets and computability theory (Q1295385) (← links)
- Definable properties of the computably enumerable sets (Q1295410) (← links)
- Dynamic notions of genericity and array noncomputability (Q1295423) (← links)
- Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees (Q1612486) (← links)
- The never-ending recursion (Q1688713) (← links)
- Concrete digital computation: what does it take for a physical system to compute? (Q2255184) (← links)
- A meaning based information theory - informalogical space: basic concepts and convergence of information sequences (Q2269790) (← links)
- Three books on computability, with a special focus on Turing's legacy. Essay review of: A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem. Book review of: R. Adams, An early history of recursive functions and computabili (Q2631823) (← links)
- Machines that perform measurements (Q2672643) (← links)
- Can Church's thesis be viewed as a Carnapian explication? (Q2695029) (← links)
- Formalism and intuition in computability (Q2941588) (← links)
- Function operators spanning the arithmetical and the polynomial hierarchy (Q3060205) (← links)
- Degrees of Unsolvability: A Tutorial (Q3195683) (← links)
- On Computability of Navier-Stokes’ Equation (Q3195712) (← links)
- Computability of the Solutions to Navier-Stokes Equations via Effective Approximation (Q3297826) (← links)
- How minds can be computational systems (Q4421273) (← links)
- Conceptual Confluence in 1936: Post and Turing (Q4637215) (← links)
- Theses for Computation and Recursion on Concrete and Abstract Structures (Q4637218) (← links)
- Why Turing’s Thesis Is Not a Thesis (Q4637226) (← links)
- 1998–99 Annual Meeting of the Association for Symbolic Logic (Q4940738) (← links)
- Mathematical and Technological Computability (Q4972862) (← links)
- Aspects of Categorical Recursion Theory (Q5014598) (← links)
- The Developments of the Concept of Machine Computability from 1936 to the 1960s (Q5250213) (← links)
- Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness (Q5250214) (← links)
- Parsimony hierarchies for inductive inference (Q5311725) (← links)
- On the hierarchies of Δ<sub>2</sub><sup>0</sup>-real numbers (Q5444099) (← links)
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY (Q5858921) (← links)
- Recursively enumerable reals and Chaitin \(\Omega\) numbers (Q5941066) (← links)
