Computability and Recursion
From MaRDI portal
Publication:5689263
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
Cites work
- scientific article; zbMATH DE number 3860368 (Why is no real title available?)
- scientific article; zbMATH DE number 3861137 (Why is no real title available?)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3700811 (Why is no real title available?)
- scientific article; zbMATH DE number 43713 (Why is no real title available?)
- scientific article; zbMATH DE number 193560 (Why is no real title available?)
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- scientific article; zbMATH DE number 3467029 (Why is no real title available?)
- scientific article; zbMATH DE number 3435453 (Why is no real title available?)
- scientific article; zbMATH DE number 3241254 (Why is no real title available?)
- scientific article; zbMATH DE number 3066801 (Why is no real title available?)
- A note on recursive functions
- A note on the Entscheidungsproblem
- Alan Turing and the Central Limit Theorem
- An Unsolvable Problem of Elementary Number Theory
- Computability and λ-definability
- Finite combinatory processes—formulation
- Formal Reductions of the General Combinatorial Decision Problem
- General recursive functions of natural numbers
- Handbook of computability theory
- Hierarchies of number-theoretic predicates
- On notation for ordinal numbers
- On the Forms of the Predicates in the Theory of Constructive Ordinals
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
- Recursive unsolvability of a problem of Thue
- Recursively enumerable sets of positive integers and their decision problems
- The constructive second number class
- The theory of recursive functions, approaching its centennial
- The word problem in semi-groups with cancellation
- Why Gödel didn't have church's thesis
- \(\lambda\)-definability and recursiveness
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
Cited in
(40)- Computation, hypercomputation, and physical science
- Mathematical and technological computability
- 1998–99 Annual Meeting of the Association for Symbolic Logic
- The developments of the concept of machine computability from 1936 to the 1960s
- On the hierarchies of Δ20-real numbers
- Concrete digital computation: what does it take for a physical system to compute?
- Turing oracle machines, online computing, and three displacements in computability theory
- How minds can be computational systems
- Fifty years of computability
- Conceptual Confluence in 1936: Post and Turing
- Syntactic structures and recursive devices: a legacy of imprecision
- Why Turing’s Thesis Is Not a Thesis
- Function operators spanning the arithmetical and the polynomial hierarchy
- scientific article; zbMATH DE number 3885307 (Why is no real title available?)
- Formalism and intuition in computability
- The never-ending recursion
- Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions
- scientific article; zbMATH DE number 6287652 (Why is no real title available?)
- scientific article; zbMATH DE number 702378 (Why is no real title available?)
- Degrees of unsolvability: a tutorial
- Kolmogorov complexity in perspective. I: Information theory and randomness
- Dynamic notions of genericity and array noncomputability
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees
- A meaning based information theory - informalogical space: basic concepts and convergence of information sequences
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- Difference sets and computability theory
- Definable properties of the computably enumerable sets
- Theses for computation and recursion on concrete and abstract structures
- On computability of Navier-Stokes' equation
- Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
- Aspects of categorical recursion theory
- 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
- Machines that perform measurements
- Immunity properties and strong positive reducibilities
- Can Church's thesis be viewed as a Carnapian explication?
- Parsimony hierarchies for inductive inference
- Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability
- The complexity of finding SUBSEQ\((A)\)
- scientific article; zbMATH DE number 1163992 (Why is no real title available?)
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)
