Hypercomputation by definition

DOI10.1016/j.tcs.2003.12.011zbMath1058.03042OpenAlexW2012543492MaRDI QIDQ1434375

Benjamin B. jun. Wells

Publication date: 4 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.12.011

zbMATH Keywords

decidable theoriescomputabilityChurch-Turing thesishypercomputationvarieties of semigroupspseudorecursive theory

Mathematics Subject Classification ID

Related Items (3)

PSEUDORECURSIVE VARIETIES OF SEMIGROUPS — II ⋮ Applying, extending, and specializing pseudorecursiveness ⋮ The case for hypercomputation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Applying, extending, and specializing pseudorecursiveness
• What evidence is there that \(2^{\land}65536\) is a natural number?
• Complete theories
• The decision problem for exponential diophantine equations
• On the integration of algebraic functions
• Strong axioms of infinity in NFU
• Explicit Provability and Constructive Semantics
• PSEUDORECURSIVE VARIETIES OF SEMIGROUPS — II
• PSEUDORECURSIVE VARIETIES OF SEMIGROUPS—I
• A formalization of Essenin-Volpin's proof theoretical studies by means of nonstandard analysis
• The Lorenz attractor exists
• Infinite time Turing machines
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• The Problem of Integration in Finite Terms
• Symbolic integration
• Non-Turing computations via Malament--Hogarth space-times

This page was built for publication: Hypercomputation by definition