scientific article

zbMath0415.03035MaRDI QIDQ3050415

J. V. Tucker

Publication date: 1980

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

zbMATH Keywords

recursion theoryalgebraic systemsalgebraic register machinesalgorithmically decidable and undecidable problems in algebra, computable functions on algebraic data typescomputable subsets of a Hausdorff topological algebrafinite algorithmic procedures

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 (4)

Floyd's principle, correctness theories and program equivalence ⋮ Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs ⋮ Computation by `While' programs on topological partial algebras ⋮ Expressiveness and the completeness of Hoare's logic

This page was built for publication: