Computability and Recursion

DOI10.2307/420992zbMATH Open0861.03031OpenAlexW2132161762WikidataQ55890014 ScholiaQ55890014MaRDI QIDQ5689263FDOQ5689263

Authors: Robert I. Soare 

Publication date: 12 May 1997

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0203-toc.htm

Recommendations

• Computability. Recursive and programmable functions
• Recursion theory. Computational aspects of definability
• scientific article; zbMATH DE number 1163992
• scientific article; zbMATH DE number 5778850
• Computability and Definability
• scientific article; zbMATH DE number 994428
• Computability and complexity theory
• scientific article; zbMATH DE number 3987247
• Computability

zbMATH Keywords

recursioncomputabilityrecursively enumerable

Mathematics Subject Classification ID

History of mathematical logic and foundations (03-03) Computability and recursion theory (03Dxx)

Cites Work

• Formal Reductions of the General Combinatorial Decision Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on the Entscheidungsproblem
• Title not available (Why is that?)
• The constructive second number class
• On notation for ordinal numbers
• Recursive unsolvability of a problem of Thue
• Title not available (Why is that?)
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• Title not available (Why is that?)
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursively enumerable sets of positive integers and their decision problems
• On the Forms of the Predicates in the Theory of Constructive Ordinals
• Alan Turing and the Central Limit Theorem
• Title not available (Why is that?)
• Why Gödel didn't have church's thesis
• An Unsolvable Problem of Elementary Number Theory
• Hierarchies of number-theoretic predicates
• Handbook of computability theory
• General recursive functions of natural numbers
• Computability and λ-definability
• The word problem in semi-groups with cancellation
• Title not available (Why is that?)
• The theory of recursive functions, approaching its centennial
• A note on recursive functions
• Finite combinatory processes—formulation
• \(\lambda\)-definability and recursiveness

Cited In (40)

• Title not available (Why is that?)
• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• Immunity properties and strong positive reducibilities
• Concrete digital computation: what does it take for a physical system to compute?
• The developments of the concept of machine computability from 1936 to the 1960s
• Formalism and intuition in computability
• Title not available (Why is that?)
• The complexity of finding SUBSEQ\((A)\)
• Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees
• Title not available (Why is that?)
• A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
• Parsimony hierarchies for inductive inference
• Syntactic structures and recursive devices: a legacy of imprecision
• Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
• Difference sets and computability theory
• Definable properties of the computably enumerable sets
• 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
• Theses for computation and recursion on concrete and abstract structures
• On computability of Navier-Stokes' equation
• Computation, hypercomputation, and physical science
• Title not available (Why is that?)
• Mathematical and technological computability
• Kolmogorov complexity in perspective. I: Information theory and randomness
• Turing oracle machines, online computing, and three displacements in computability theory
• Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability
• Machines that perform measurements
• Conceptual Confluence in 1936: Post and Turing
• Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions
• How minds can be computational systems
• Fifty years of computability
• The never-ending recursion
• Can Church's thesis be viewed as a Carnapian explication?
• 1998–99 Annual Meeting of the Association for Symbolic Logic
• Dynamic notions of genericity and array noncomputability
• On the hierarchies of Δ₂⁰-real numbers
• Function operators spanning the arithmetical and the polynomial hierarchy
• Degrees of unsolvability: a tutorial
• Aspects of categorical recursion theory
• Why Turing’s Thesis Is Not a Thesis
• A meaning based information theory - informalogical space: basic concepts and convergence of information sequences

This page was built for publication: Computability and Recursion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5689263)