Understanding Computation: A General Theory of Computational Processes

The notion of computation is well understood, and well formalized, in the classical context of digital information processing. However, the paradigm of computation is increasingly used in the characterization of processes in sciences like physics and biology as well. This seems to recognize computation more broadly as an ‘elementary mechanism of nature’, not limited to the digital
domain. What is computation, if it is observed in this broader sense? Without
computers as the single defining mechanism, classical abstractions like Turing
machines and rewrite systems seem to be unsuited to capture its newer meanings. Following our epistemic approach, we develop a new framework for understanding computation and, as a consequence, for understanding computational processes, based on observed trajectories (curves) of computational activity in suitable metric spaces. With computational processes rather than all sorts of different models of computation as the core abstraction, one can model and characterize many aspects of computation as a mathematical object, from composition to computational and structural complexity. Discrete computations appear as projections of continuous ones, clarifying a complex issue from Turing’s 1948 report. We present both the philosophy and a first outline of the implied, machine-independent, general mathematical theory of computation.