Program algebra for Turing-machine programs

DOI10.7561/SACS.2019.2.113MaRDI QIDQ5089609zbMATH OpenFDO

Authors J. A. Bergstra, C. A. Middelburg

Publication date 19 July 2022

Published in Scientific Annals of Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1901.08840

zbMATH Keywords

computational complexitycomputabilityprogram algebramodel of computationthread algebraTuring-machine program

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Classical models of computation (Turing machines, etc.) (68Q04)

Recommendations

• A short introduction to program algebra with instructions for Boolean registers
• scientific article; zbMATH DE number 947381
• Instruction sequence processing operators
• scientific article; zbMATH DE number 4068842
• Program algebra for sequential code

Cited in

(9)

• A short introduction to program algebra with instructions for Boolean registers
• Instruction sequence processing operators
• Program algebra for random access machine programs
• Programming and automating mathematics in the Tarski-Kleene hierarchy
• Program algebras of recursive functions
• An instruction sequence semigroup with involutive anti-automorphisms
• Execution architectures for program algebra
• scientific article; zbMATH DE number 4068842 (Why is no real title available?)
• On instruction sets for Boolean registers in program algebra

This page was built for publication: Program algebra for Turing-machine programs

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