Instruction Sequences Expressing Multiplication Algorithms

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. We describe instruction seq...

Full description

Bibliographic Details

Published in:	Scientific annals of computer science Vol. 28; no. 1; pp. 39 - 66
Main Authors:	Bergstra, J A, Middelburg, C A
Format:	Journal Article
Language:	English
Published:	Iasi Alexandru Ioan Cuza University of Iasi 01.01.2018
Subjects:	Algorithms Boolean algebra Multiplication Multiplication & division Number theory Sequences Strings
ISSN:	1843-8121, 2248-2695
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!