Ways to Compute in Euclidean Frameworks - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Ways to Compute in Euclidean Frameworks

Abstract

This tutorial presents what kind of computation can be carried out inside a Euclidean space with dedicated primitives---and discrete or hybrid (continuous evolution between discrete transitions) time scales. The presented models can perform Classical (Turing, discrete) computations as well as, for some, hyper and analog computations (thanks to the continuity of space). The first half of the tutorial presents three models of computation based on respectively: ruler and compass, local constraints and emergence of polyhedra/polytopes and piece-wise constant derivative. The other half concentrates on signal machines: line segments are extended and replaced on meeting. These machines are capable hyper-computation and analog computation and to solve PSPACE-problem in ``constant space and time'' though partial fractal generation.
No file

Dates and versions

hal-01557281 , version 1 (06-07-2017)

Identifiers

  • HAL Id : hal-01557281 , version 1

Cite

Jérôme Durand-Lose. Ways to Compute in Euclidean Frameworks. 16th International Conference Unconventional Computation and Natural Computation (UCNC 2017), Matthew J. Patitz, Jun 2017, Fayetteville, AR, United States. pp.8-25. ⟨hal-01557281⟩
124 View
0 Download

Share

Gmail Facebook X LinkedIn More