Super-Recursive Algorithms

DOI10.1007/B138114MaRDI QIDQ3157968zbMATH OpenOpenAlexFDO

Authors Mark Burgin

Publication date 20 January 2005

Published in Monographs in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b138114

zbMATH Keywords

computabilitysuper-recursive algorithms

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Nonnumerical algorithms (68W05) Turing machines and related notions (03D10)

Recommendations

• Second-level algorithms, superrecursivity, and recovery problem in distributed systems
• Hypercomputation
• Algorithmic complexity of recursive and inductive algorithms
• New Models of Computation
• scientific article; zbMATH DE number 194513

Cited in

(10)

• Computational technosphere and cellular engineering
• On computable numbers, nonuniversality, and the genuine power of parallelism
• The myth of `the myth of hypercomputation'
• Recursively Generated Evolutionary Turing Machines and Evolutionary Automata
• p-adic physics, non-well-founded reality and unconventional computing
• Approximate reasoning in the algebra of bounded rational agents
• Inductive complexity of P versus NP problem (extended abstract)
• The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
• On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus
• Hypercomputation

This page was built for publication: Super-Recursive Algorithms

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