scientific article

zbMath0463.03026MaRDI QIDQ3912570

J. V. Tucker

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algebraic data typescomputable subsets of a Hausdorff topological algebraalgebraic register machinealgorithmically decidable and undecidable problems in algebrafinite algorithmic procedure

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Data structures (68P05) Applications of computability and recursion theory (03D80) Other topological algebraic systems and their representations (22A30) Turing machines and related notions (03D10) Algorithms in computer science (68W99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (2)

Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ Generalizing Computability Theory to Abstract Algebras

This page was built for publication: