Computable concurrent processes

AbstractWe study relative computability for processes and process transformations, in general, and in particular the non-deterministic and concurrent processes which can be specified in terms of various fair merge constructs. The main result is a normal form theorem for these (relatively) computable process functions which implies that although they can be very complex when viewed as classical set-functions, they are all “loosely implementable” in the sense of Park (1980). The precise results are about the player model of concurrency introduced in Moschovakis (1991), which supports both fairness constructs and full recursion