Computability of String Functions Over Algebraic Structures Armin Hemmerling

DOI10.1002/MALQ.19980440102MaRDI QIDQ4379625zbMATH OpenOpenAlexFDO

Authors Armin Hemmerling

Publication date 4 March 1998

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

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

zbMATH Keywords

Blum-Shub-Smale modelmodel of computationstring functions over abstract algebraic structures with finite signature

Mathematics Subject Classification ID

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

Recommendations

• Computability Over Structures of Infinite Signature
• Generalizing Computability Theory to Abstract Algebras
• Toward a generalized computability theory

Cites work

• scientific article; zbMATH DE number 177847 (Why is no real title available?)
• scientific article; zbMATH DE number 503394 (Why is no real title available?)
• scientific article; zbMATH DE number 218551 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Fundamentals of generalized recursion theory
• On formalised computer programs
• Program schemes, recursion schemes, and formal languages
• Theorie der Numerierungen I
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I

Cited in

(12)

• On approximate and algebraic computability over the real numbers
• Computation over algebraic structures and a classification of undecidable problems
• P versus NP and computability theoretic constructions in complexity theory over algebraic structures
• On the P-NP problem over real matrix rings
• Algebraic string operations
• On the cost of uniform and nonuniform algorithms
• A formal framework for stringology
• A topological view on algebraic computation models
• The P-DNP problem for infinite Abelian groups
• Computing measure as a primitive operation in real number computation
• \(\mathbf P =\mathbf{NP}\) for some structures over the binary words
• scientific article; zbMATH DE number 4212279 (Why is no real title available?)

This page was built for publication: Computability of String Functions Over Algebraic Structures Armin Hemmerling

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