Long multiplication by instruction sequences with backward jump instructions
arXiv:1312.1812
Abstract
For each function on bit strings, its restriction to bit strings of any given length can be computed by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction. Backward jump instructions are not necessary for this, but instruction sequences can be significantly shorter with them. We take the function on bit strings that models the multiplication of natural numbers on their representation in the binary number system to demonstrate this by means of a concrete example. The example is reason to discuss points concerning the halting problem and the concept of an algorithm.
arXiv comment17 pages, the preliminaries are about the same as the preliminaries in arXiv:1308.0219 [cs.PL] and arXiv:1312.1529 [cs.PL]; minor errors corrected, references added; section on indirect addressing added
References in corpus (5)
- On algorithmic equivalence of instruction sequences for computing bit string functions
- Instruction sequence based non-uniform complexity classes
- An Instruction Sequence Semigroup with Involutive Anti-Automorphisms
- Instruction sequence expressions for the secure hash algorithm SHA-256
- Instruction sequences expressing multiplication algorithms