Elementary Complexity into the Hyperfinite II1 Factor


Marco Pedicini, Mario Piazza


In this paper, we show how the framework of von Neumann algebras can be applied to model the dynamics of computational processes. Namely, our aim is to gain an understanding of classical computation in terms of the hyperfinite factor, starting from the class of Kalmar recursive functions. Our model fits within a vast project of reshaping the unified theory of semantics of computation called geometry of interaction along the lines recently sketched by J.Y. Girard.

Download: pedicini2.pdf