Abstract versus concrete computability: the case of countable algebras

zbMATH Open1116.03037MaRDI QIDQ5477367FDOQ5477367

Jeffery Zucker, John V. Tucker

Publication date: 3 July 2006

zbMATH Keywords

data representationmany-sorted algebraabstract computabilitynumbering (coding) of a structure

Mathematics Subject Classification ID

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

Cited In (6)

• Theses for Computation and Recursion on Concrete and Abstract Structures
• Computability of analog networks
• Generalizing Computability Theory to Abstract Algebras
• Models of computation for partial functions on the reals
• Abstract versus concrete computation on metric partial algebras
• Continuity of operators on continuous and discrete time streams

   Recommendations

• Abstract versus concrete computation on metric partial algebras 👍 👎
• Generalizing Computability Theory to Abstract Algebras 👍 👎
• Abstract computability and algebraic specification 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)