Abstract

A partial combinatory algebra (PCA) is a model of computation that embodies a certain notion of algorithm. The elements of a PCA act simultaneously as algorithms and as inputs that may be fed to these algorithms. For each PCA, we can construct a model of intuitionistic mathematics, called the realizability
... read more