On the contribution of backward jumps to instruction sequence expressiveness
| Authors | |
|---|---|
| Publication date | 2010 |
| Number of pages | 16 |
| Publisher | Ithaca, NY: ArXiv |
| Organisations |
|
| Abstract | We investigate the expressiveness of backward jumps in a framework of formalized sequential programming called program algebra. We show that - if expressiveness is measured in terms of the computability of partial Boolean functions - then backward jumps are superfluous. If we, however, want to prevent explosion of the length of programs, then backward jumps are essential. |
| Document type | Report |
| Published at | |
| Downloads |
325928.pdf
(Submitted manuscript)
|
| Permalink to this page | |
