Computability and Recursion
From MaRDI portal
Publication:5689263
DOI10.2307/420992zbMath0861.03031OpenAlexW2132161762WikidataQ55890014 ScholiaQ55890014MaRDI QIDQ5689263
Publication date: 12 May 1997
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0203-toc.htm
Related Items
Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees ⋮ The complexity of finding SUBSEQ\((A)\) ⋮ Parsimony hierarchies for inductive inference ⋮ Degrees of Unsolvability: A Tutorial ⋮ On Computability of Navier-Stokes’ Equation ⋮ Formalism and intuition in computability ⋮ Machines that perform measurements ⋮ The never-ending recursion ⋮ Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability ⋮ Can Church's thesis be viewed as a Carnapian explication? ⋮ Syntactic structures and recursive devices: a legacy of imprecision ⋮ 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 computability from Gödel to Turing; B. J. Copeland (ed.) et al., Computability. Turing, Gödel, church, and beyond; G. Sommaruga and T. Strahm (ed.), Turing's revolution. The impact of his ideas about computability ⋮ Computability of the Solutions to Navier-Stokes Equations via Effective Approximation ⋮ Conceptual Confluence in 1936: Post and Turing ⋮ Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ Why Turing’s Thesis Is Not a Thesis ⋮ Computation, hypercomputation, and physical science ⋮ Concrete digital computation: what does it take for a physical system to compute? ⋮ Immunity properties and strong positive reducibilities ⋮ Recursively enumerable reals and Chaitin \(\Omega\) numbers ⋮ A meaning based information theory - informalogical space: basic concepts and convergence of information sequences ⋮ 1998–99 Annual Meeting of the Association for Symbolic Logic ⋮ How minds can be computational systems ⋮ On the hierarchies of Δ20-real numbers ⋮ Function operators spanning the arithmetical and the polynomial hierarchy ⋮ Mathematical and Technological Computability ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ Difference sets and computability theory ⋮ Definable properties of the computably enumerable sets ⋮ Dynamic notions of genericity and array noncomputability ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s ⋮ Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness ⋮ A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY ⋮ Aspects of Categorical Recursion Theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Handbook of computability theory
- General recursive functions of natural numbers
- \(\lambda\)-definability and recursiveness
- The word problem in semi-groups with cancellation
- Hierarchies of number-theoretic predicates
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
- Why Gödel didn't have church's thesis
- The theory of recursive functions, approaching its centennial
- Alan Turing and the Central Limit Theorem
- Recursive Unsolvability of a problem of Thue
- An Unsolvable Problem of Elementary Number Theory
- A note on the Entscheidungsproblem
- A note on recursive functions
- Finite combinatory processes—formulation
- Computability and λ-definability
- The constructive second number class
- On notation for ordinal numbers
- On the Forms of the Predicates in the Theory of Constructive Ordinals
- Formal Reductions of the General Combinatorial Decision Problem
- Recursively enumerable sets of positive integers and their decision problems
