Universal logic elements constructed on the Turing Tumble
| Autor: | Teijiro Isokawa, Takayuki Yumoto, Jia Lee, Takahiro Tomita, Ferdinand Peper, Naotake Kamiura |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Scheme (programming language)
Theoretical computer science Computer science Complex system Universal logic 0102 computer and information sciences 02 engineering and technology Directed acyclic graph 01 natural sciences Computer Science Applications Constraint (information theory) 010201 computation theory & mathematics Mechanical computer Theory of computation 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing computer Turing computer.programming_language |
| Zdroj: | Natural Computing. 19:787-795 |
| ISSN: | 1572-9796 1567-7818 |
| DOI: | 10.1007/s11047-019-09760-8 |
| Popis: | This paper presents a mathematical model for a mechanical computer called the Turing Tumble. We show that our model called Turing Tumble Model (TTM) is computationally universal under the assumptions that a configuration of TTM is sufficiently large and that local interactions between elements can be transferred without limitations. The Turing Tumble has a strict constraint, based on gravity, since signals can only move from top to bottom. We introduce a uniform scheme that takes into account this restriction in directionality to construct universal machines in the TTM based on directed acyclic graphs. This model may be useful for implementing computers that exploit mechanical interactions in nature, especially those on micrometer-scales. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink