Generalizing Computability Theory to Abstract Algebras

DOI10.1007/978-3-319-22156-4_5MaRDI QIDQ4637219zbMATH OpenOpenAlexFDO

Authors John V. Tucker, Jeffery Zucker

Publication date 18 April 2018

Published in Turing’s Revolution (Search for Journal in Brave)

Full work available at URL https://cronfa.swan.ac.uk/Record/cronfa30876/Download/0030876-31102016101607.pdf

zbMATH Keywords

generalized computabilitycomputability on the realscomputability and continuitycomputability on abstract structuresgeneralized Church-Turing thesis

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• scientific article; zbMATH DE number 23020
• scientific article; zbMATH DE number 3959413
• Abstract computability and algebraic specification
• Toward a generalized computability theory
• scientific article; zbMATH DE number 2063217
• Universal algebra and applications in theoretical computer science
• Abstract versus concrete computability: the case of countable algebras
• scientific article; zbMATH DE number 3933053
• Computability in partial combinatory algebras
• Abstract Computability and Invariant Definability

Cites work

• scientific article; zbMATH DE number 3685474 (Why is no real title available?)
• scientific article; zbMATH DE number 3724432 (Why is no real title available?)
• scientific article; zbMATH DE number 192929 (Why is no real title available?)
• scientific article; zbMATH DE number 3513761 (Why is no real title available?)
• scientific article; zbMATH DE number 3563392 (Why is no real title available?)
• scientific article; zbMATH DE number 1302869 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1390022 (Why is no real title available?)
• scientific article; zbMATH DE number 3212274 (Why is no real title available?)
• scientific article; zbMATH DE number 3285221 (Why is no real title available?)
• scientific article; zbMATH DE number 3348095 (Why is no real title available?)
• scientific article; zbMATH DE number 3349780 (Why is no real title available?)
• scientific article; zbMATH DE number 3383999 (Why is no real title available?)
• scientific article; zbMATH DE number 3200656 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• scientific article; zbMATH DE number 3077999 (Why is no real title available?)
• scientific article; zbMATH DE number 3084450 (Why is no real title available?)
• Abstract versus concrete computation on metric partial algebras
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Characterizations of semicomputable sets of real numbers
• Computability of analog networks
• Computability of operators on continuous and discrete time streams
• Computable Algebra, General Theory and Theory of Computable Fields
• Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
• Computation by `While' programs on topological partial algebras
• Continuity of operators on continuous and discrete time streams
• Effective procedures in field theory
• Finite alogorithmic procedures and computation theories.
• Models of computation for partial functions on the reals
• Notions of semicomputability in topological algebras over the reals
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Topological properties of real number representations.
• Turing’s Revolution
• Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms

Cited in

(12)

• scientific article; zbMATH DE number 4021127 (Why is no real title available?)
• scientific article; zbMATH DE number 1870419 (Why is no real title available?)
• Notions of semicomputability in topological algebras over the reals
• Universality and semicomputability for nondeterministic programming languages over abstract algebras
• Computing coproducts of finitely presented Gödel algebras
• Abstract versus concrete computability: the case of countable algebras
• Theses for computation and recursion on concrete and abstract structures
• scientific article; zbMATH DE number 4154430 (Why is no real title available?)
• Hypercomputation by definition
• Abstract versus concrete computation on metric partial algebras
• Toward a generalized computability theory
• Computable total functions on metric algebras, universal algebraic specifications and dynamical systems

This page was built for publication: Generalizing Computability Theory to Abstract Algebras

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