Computing with signals: a generic and modular signal machine for satisfiability problems

Abstract : Signal machines are an abstract and geometrical model of computation, where computations consist in colored segment lines and their intersections in the Euclidean plane. In this talk, we first introduce the model and give some basic properties, and then we illustrate the power of signal machines by a geometrical construction solving Q-SAT in bounded space and time, by the use of space-time continuity. We will also discuss some new complexities measure, more adapted to signal machines
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00749867
Contributor : Jérôme Durand-Lose <>
Submitted on : Thursday, November 8, 2012 - 3:05:49 PM
Last modification on : Thursday, January 17, 2019 - 3:06:04 PM

Identifiers

  • HAL Id : hal-00749867, version 1

Collections

Citation

Denys Duchier, Jérôme Durand-Lose, Maxime Senot. Computing with signals: a generic and modular signal machine for satisfiability problems. Workshop New Worlds of Computation (NWC '11), May 2011, Orléans, France. ⟨hal-00749867⟩

Share

Metrics

Record views

68