Straight-line instruction sequence completeness for total calculation on cancellation meadows
From MaRDI portal
Publication:538468
Recommendations
Cites work
- scientific article; zbMATH DE number 3872653 (Why is no real title available?)
- Application of universal constraints in the analysis of classification algorithms
- Combining programs and state machines
- Decision problems for pushdown threads
- Instruction sequence processing operators
- Logical Approaches to Computational Barriers
- Meadows and the equational specification of division
- On the Simplification and Equivalence Problems for Straight-Line Programs
- Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
- Program algebra for sequential code
- The initial meadows
- The rational numbers as an abstract data type
- The structure of finite meadows
- Thread algebra for strategic interleaving
Cited in
(3)
This page was built for publication: Straight-line instruction sequence completeness for total calculation on cancellation meadows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q538468)