Abstract versus concrete computability: the case of countable algebras

MaRDI QIDQ5477367zbMATH OpenFDO

Authors John V. Tucker, Jeffery Zucker

Publication date 3 July 2006

zbMATH Keywords

abstract computabilitydata representationmany-sorted algebranumbering (coding) of a structure

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Abstract and axiomatic computability and recursion theory (03D75) Abstract data types; algebraic specification (68Q65)

Recommendations

• Abstract versus concrete computation on metric partial algebras
• Generalizing Computability Theory to Abstract Algebras
• Abstract computability and algebraic specification
• scientific article; zbMATH DE number 23020
• scientific article; zbMATH DE number 4051602

Cited in

(7)

• Models of computation for partial functions on the reals
• scientific article; zbMATH DE number 4051602 (Why is no real title available?)
• Theses for computation and recursion on concrete and abstract structures
• Generalizing Computability Theory to Abstract Algebras
• Abstract versus concrete computation on metric partial algebras
• Continuity of operators on continuous and discrete time streams
• Computability of analog networks

This page was built for publication: Abstract versus concrete computability: the case of countable algebras

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