Hypercomputation by definition

DOI10.1016/J.TCS.2003.12.011MaRDI QIDQ1434375zbMATH OpenOpenAlexFDO

Authors Benjamin 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

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Equational classes, universal algebra in model theory (03C05) Complexity of computation (including implicit computational complexity) (03D15) Undecidability and degrees of sets of sentences (03D35) Varieties and pseudovarieties of semigroups (20M07) Word problems, etc. in computability and recursion theory (03D40)

Recommendations

• Hypercomputation: Philosophical issues
• Generalizing Computability Theory to Abstract Algebras
• Algebraic computability and enumeration models. Recursion theory and descriptive complexity
• scientific article; zbMATH DE number 2063217
• scientific article; zbMATH DE number 1869998

Cites work

• scientific article; zbMATH DE number 3924764 (Why is no real title available?)
• scientific article; zbMATH DE number 3685805 (Why is no real title available?)
• scientific article; zbMATH DE number 42574 (Why is no real title available?)
• scientific article; zbMATH DE number 44058 (Why is no real title available?)
• scientific article; zbMATH DE number 108079 (Why is no real title available?)
• scientific article; zbMATH DE number 108109 (Why is no real title available?)
• scientific article; zbMATH DE number 1062123 (Why is no real title available?)
• scientific article; zbMATH DE number 1158842 (Why is no real title available?)
• scientific article; zbMATH DE number 4118351 (Why is no real title available?)
• scientific article; zbMATH DE number 1869998 (Why is no real title available?)
• scientific article; zbMATH DE number 1870122 (Why is no real title available?)
• scientific article; zbMATH DE number 784042 (Why is no real title available?)
• scientific article; zbMATH DE number 3310055 (Why is no real title available?)
• scientific article; zbMATH DE number 3324725 (Why is no real title available?)
• scientific article; zbMATH DE number 3183995 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• A formalization of Essenin-Volpin's proof theoretical studies by means of nonstandard analysis
• Applying, extending, and specializing pseudorecursiveness
• Complete theories
• Explicit provability and constructive semantics
• Infinite time Turing machines
• Non-Turing computations via Malament--Hogarth space-times
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the integration of algebraic functions
• PSEUDORECURSIVE VARIETIES OF SEMIGROUPS—I
• Pseudorecursive varieties of semigroups. II
• Strong axioms of infinity in NFU
• Symbolic integration
• The Lorenz attractor exists
• The Problem of Integration in Finite Terms
• The decision problem for exponential diophantine equations
• What evidence is there that \(2^{\land}65536\) is a natural number?

Cited in

(5)

• scientific article; zbMATH DE number 1909825 (Why is no real title available?)
• scientific article; zbMATH DE number 1869998 (Why is no real title available?)
• Applying, extending, and specializing pseudorecursiveness
• The case for hypercomputation
• Pseudorecursive varieties of semigroups. II

This page was built for publication: Hypercomputation by definition

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