Occam's Razor and Computer-Program Testing (original) (raw)

IEEE Transactions on Reliability, 1982

Abstract

Occam's Razor and * The proof seems feasible for a class of programs which I Computer-Program Testing have called O-Class ('O' for Occam's Razor). This class includes not only programs for addition and subtraction (which can be performed by finite-state machines) but also Peter Schorer for multiplication, division, and exponentiation. These latHewlett-Packard Co., Palo Alto ter three functions require arbitrarily large memory, hence cannot be performed by finite-state machines. Thus O-Class has a claim to being a useful class. Indeed

Peter Schorer hasn't uploaded this paper.

Let Peter know you want this paper to be uploaded.

Ask for this paper to be uploaded.