scientific article; zbMATH DE number 3645075

MaRDI QIDQ3050415zbMATH OpenFDO

Authors John V. Tucker

Publication date 1980

zbMATH Keywords

algebraic register machinesalgebraic systemsalgorithmically decidable and undecidable problems in algebra, computable functions on algebraic data typescomputable subsets of a Hausdorff topological algebrafinite algorithmic proceduresrecursion theory

Mathematics Subject Classification ID

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

Cited in

(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:

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