Instruction sequence processing operators

DOI10.1007/S00236-012-0154-2zbMATH Open1279.68075OpenAlexW3102090504MaRDI QIDQ715042FDOQ715042

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

Publication date 15 October 2012

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-012-0154-2

zbMATH Keywords

autosolvability requirementinstruction sequenceundecidability of the halting problemuniversal computable functional unit for natural numbers

Mathematics Subject Classification ID

General topics in the theory of software (68N01) General topics in the theory of computing (68Q01)

Recommendations

• Instruction sequences for computer science.
• On machines, universal by extensions
• Program algebra for Turing-machine programs
• On the behaviours produced by instruction sequences under execution
• ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON

Cites Work

• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 1114344 (Why is no real title available?)
• scientific article; zbMATH DE number 1142323 (Why is no real title available?)
• A note on files in pascal
• A thread algebra with multi-level strategic interleaving
• A thread calculus with molecular dynamics
• Combining programs and state machines
• Computability of Recursive Functions
• Computational Complexity
• Execution architectures for program algebra
• General recursive functions of natural numbers
• Instruction sequence processing operators
• Inversive meadows and divisive meadows
• Logical Approaches to Computational Barriers
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On the behaviours produced by instruction sequences under execution
• On the expressiveness of single-pass instruction sequences
• On the operating unit size of load/store architectures
• Program algebra for component code
• Program algebra for sequential code
• Program algebra with a jump-shift instruction
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Relative complexity of algebras
• Solvability of the halting problem for certain classes of Turing machines
• The rational numbers as an abstract data type
• Transmission Protocols for Instruction Streams

Cited In (7)

• On the contribution of backward jumps to instruction sequence expressiveness
• Instruction sequence processing operators
• Inversive meadows and divisive meadows
• Instruction sequences for computer science.
• Instruction sequence faults with formal change justification
• Straight-line instruction sequence completeness for total calculation on cancellation meadows
• Program algebra for Turing-machine programs

Uses Software

• ALGOL 60

This page was built for publication: Instruction sequence processing operators

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