Straight-line Instruction Sequence Completeness for Total Calculations on Cancellation Meadows
| Authors | |
|---|---|
| Publication date | 2011 |
| Journal | Theory of Computing Systems |
| Volume | Issue number | 48 | 4 |
| Pages (from-to) | 840-864 |
| Number of pages | 25 |
| Organisations |
|
| Abstract |
A combination of program algebra with the theory of meadows is designed leading to a theory of computation in algebraic structures. It is proven that total functions on cancellation meadows can be computed by straight-line programs using at most five auxiliary variables. A similar result is obtained for signed meadows. |
| Document type | Article |
| Language | English |
| Published at | https://doi.org/10.1007/s00224-010-9272-9 |
| Downloads |
337991.pdf
(Final published version)
|
| Permalink to this page | |
