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

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

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)

Cites Work

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

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)