Instruction sequence processing operators
From MaRDI portal
Publication:715042
DOI10.1007/s00236-012-0154-2zbMath1279.68075OpenAlexW3102090504MaRDI QIDQ715042
C. A. Middelburg, Jan 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
autosolvability requirementinstruction sequenceundecidability of the halting problemuniversal computable functional unit for natural numbers
Related Items
Inversive meadows and divisive meadows, On the contribution of backward jumps to instruction sequence expressiveness, Straight-line instruction sequence completeness for total calculation on cancellation meadows, Instruction sequence processing operators
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inversive meadows and divisive meadows
- On the expressiveness of single-pass instruction sequences
- Instruction sequence processing operators
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Execution architectures for program algebra
- Program algebra with a jump-shift instruction
- A thread calculus with molecular dynamics
- Program algebra for component code
- Solvability of the halting problem for certain classes of Turing machines
- Program algebra for sequential code
- Combining programs and state machines
- A thread algebra with multi-level strategic interleaving
- General recursive functions of natural numbers
- Transmission Protocols for Instruction Streams
- The rational numbers as an abstract data type
- On the operating unit size of load/store architectures
- Relative complexity of algebras
- A note on files in pascal
- On the Behaviours Produced by Instruction Sequences under Execution
- Computational Complexity
- Computability of Recursive Functions
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Logical Approaches to Computational Barriers
