Computability Over Structures of Infinite Signature

DOI10.1002/MALQ.19980440311MaRDI QIDQ4210842zbMATH OpenOpenAlexFDO

Authors Armin Hemmerling

Publication date 17 August 1999

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19980440311

zbMATH Keywords

existence resultsBlum-Shub-Smale modelarbitrary signatureseffective codabilitymodel of computation for string functions over abstract algebraic structures

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• Computability of String Functions Over Algebraic Structures Armin Hemmerling
• Toward a generalized computability theory
• Generalizing Computability Theory to Abstract Algebras
• scientific article; zbMATH DE number 23020

Cites work

• Computing over the reals with addition and order: Higher complexity classes

Cited in

(3)

• Algorithmic properties of models with signatures containing two unary functional symbols
• P versus NP and computability theoretic constructions in complexity theory over algebraic structures
• Calculs sur les structures de langage dénombrable

This page was built for publication: Computability Over Structures of Infinite Signature

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