arXiv Open Access 2013

Long multiplication by instruction sequences with backward jump instructions

J. A. Bergstra C. A. Middelburg

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.PL

Penulis (2)

J. A. Bergstra

C. A. Middelburg

Format Sitasi

APA MLA BibTeX

Bergstra, J.A., Middelburg, C.A. (2013). Long multiplication by instruction sequences with backward jump instructions. https://arxiv.org/abs/1312.1812

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2013
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓