Straight-line instruction sequence completeness for total calculation on cancellation meadows
| Authors | |
|---|---|
| Publication date | 2009 |
| Number of pages | 24 |
| Publisher | Ithaca, NY: ArXiv |
| Organisations |
|
| Abstract | A combination of program algebra with the theory of meadows is designed leading to a theory of computation in algebraic structures which use in addition to a zero test and copying instructions the instruction set $\{x \Leftarrow 0, x \Leftarrow 1, x\Leftarrow -x, x\Leftarrow x^{-1}, x\Leftarrow x+y, x\Leftarrow x\cdot y\}$. It is proven that total functions on cancellation meadows can be computed by straight-line programs using at most 5 auxiliary variables. A similar result is obtained for signed meadows. |
| Document type | Report |
| Published at | http://arxiv.org/abs/0905.4612 |
| Downloads |
319475.pdf
(Submitted manuscript)
|
| Permalink to this page | |
