On the complexity of the correctness problem for non-zeroness test instruction sequences

05/15/2018

∙

by   J. A. Bergstra, et al.

∙

0

∙

share

In this paper, we consider the programming of the function on bit strings of length n (n > 0) that models the non-zeroness test on natural numbers less than 2^n with respect to their binary representation by bit strings of length n using 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 focus on the complexity of the problem of deciding whether an instruction sequence of this kind correctly implements the function modeling the non-zeroness test.