Abstract geometrical computation 7: geometrical accumulations and computably enumerable real numbers

作者：Durand Lose Jerome^*

来源：Natural Computing, 2012, 11(4): 609-622.

DOI：10.1007/s11047-012-9335-8

• Abstract geometrical computations
• Computable analysis
• Geometrical accumulations
• C.e. and d-c.e. real numbers
• Signal machine

Using rules to automatically extend a drawing on an Euclidean space might lead to accumulating drawings into a single point. Such points are characterized in the context of Abstract geometrical computation. Colored line segments (traces of signals) are drawn according to rules: signals with similar color are parallel and when they intersect, they are replaced according to their colors. Time and space are continuous and accumulations can happen. Constructions exist to unboundedly accelerate a computation and provide, in a finite duration, exact analog values as limits/accumulations. Starting with rational numbers for coordinates and speeds, the time of any isolated accumulation is a c.e. (computably enumerable) real number. There is a signal machine and an initial configuration that accumulates at any c.e. time. Similarly, the spatial positions of isolated accumulations are exactly the d-c.e. (difference of computably enumerable) numbers. Moreover, there is a signal machine that can accumulate at any c.e. time or d-c.e. position depending only on the initial configuration. These existence results rely on a two-level construction: an inner structure simulates a Turing machine that output orders to the outer structure which handles the accumulation.

• 出版日期2012-12