arXiv Open Access 2014

On algorithmic equivalence of instruction sequences for computing bit string functions

J. A. Bergstra C. A. Middelburg

Lihat Sumber

Abstrak

Every partial function from bit strings of a given length to bit strings of a possibly different 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. We look for an equivalence relation on instruction sequences of this kind that captures to a reasonable degree the intuitive notion that two instruction sequences express the same algorithm.

Topik & Kata Kunci

cs.LO

Penulis (2)

J. A. Bergstra

C. A. Middelburg

Format Sitasi

APA MLA BibTeX

Bergstra, J.A., Middelburg, C.A. (2014). On algorithmic equivalence of instruction sequences for computing bit string functions. https://arxiv.org/abs/1402.4950

Akses Cepat

Lihat di Sumber

Informasi Jurnal

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