Branching space-times and parallel processing

Abstract

In this paper, we investigate the invariance properties, i.e. robustness, of phenomena related to the notions of algorithm, finite procedure and explicit construction. First of all, we provide two examples of objects for which small changes completely change their (non)computational behavior. We then isolate robust phenomena in two disciplines related to computability.