Space-like Computing in Computing Devices

Abstract

Computing systems and computer-implemented methods for specifying distributed computing. The systems and methods utilize computer readable code that causes a computer to participate in reversible, self-organizing, hierarchical space-like computation that creates information. At least one sensor and effector adapted to react to an environment external to the computer / computing system may create information based on input from or "experience" with respect to the environment.

Description

technical field [0001] The present invention relates generally to systems and methods for running a computing environment on a computing device, and more particularly to systems and methods for configuring a computing device to perform non-Turing-restricted computing. Background technique [0002] Computation, whether understood as an explicit execution on hardware or more abstractly as a literal sequence of unspecified events, is time-like in nature because, at its core, each step is fundamentally irreversible of. Sequential computations by their very nature consume information, and this includes so-called parallel processing or parallelism: the organized execution of multiple copies of one or more sequential processes. These are facts supported by key mathematical theorems of Alan Turing and Claude Shannon. [0003] The present disclosure proposes a new type of computation that is conceptually opposed to time-like computation—space-like computation. Space-like computati...

AI Technical Summary

Problems solved by technology

[0014] Fourth, space-like computation is not Turing-restricted, meaning that real space-like computation, which is by definition limited to sequential computation (including parallelism), cannot be simulated by a universal Turing machine

[0015] Fifth, unless the space-like computation is connected to and interacts with the environment, the space-like computation is meaningless, because the space-like computation cannot grow if it is not connected

Furthermore, these states are simultaneous and independent, and thus not distinguishable in terms of time (i.e., sequence)

[0025] Therefore, information about being in (and about) the environment cannot be obtained sequentially, and thus true concurrency cannot be simulated by a Turing machine

Images