Small Turing universal signal machines

被引：0
|
作者：
Durand-Lose, Jerome [1 ]
机构：
[1] Univ Orleans, Lab Informat Fondamentale Orleans, BP 6759, F-45067 Orleans 2, France
来源：
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE | 2009年 / 01期
关键词：
D O I：
10.4204/EPTCS.1.7
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This article aims at providing signal machines as small as possible able to perform any computation (in the classical understanding) After presenting signal machines, it is shown how to get universal ones from Turing machines, cellular-automata and cyclic tag systems. Finally a halting universal signal machine with 13 meta-signals and 21 collision rules is presented.
引用
收藏
页码：70 / 80
页数：11
相关论文
共 50 条
  • [1] Small universal turing machines
    Rogozhin, Y
    [J]. THEORETICAL COMPUTER SCIENCE, 1996, 168 (02) : 215 - 240
  • [2] Abstract geometrical computation 4: Small Turing universal signal machines
    Durand-Lose, Jerome
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (1-2) : 57 - 67
  • [3] Four small universal turing machines
    Neary, Turlough
    Woods, Damien
    [J]. MACHINES, COMPUTATIONS, AND UNIVERSALITY, PROCEEDINGS, 2007, 4664 : 242 - +
  • [4] Small fast universal Turing machines
    Neary, Turlough
    Woods, Damien
    [J]. THEORETICAL COMPUTER SCIENCE, 2006, 362 (1-3) : 171 - 195
  • [5] Small Weakly Universal Turing Machines
    Neary, Turlough
    Woods, Damien
    [J]. FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2009, 5699 : 262 - +
  • [6] The complexity of small universal turing machines
    Woods, Damien
    Neary, Turlough
    [J]. COMPUTATION AND LOGIC IN THE REAL WORLD, PROCEEDINGS, 2007, 4497 : 791 - +
  • [7] Four Small Universal Turing Machines
    Neary, Turlough
    Woods, Damien
    [J]. FUNDAMENTA INFORMATICAE, 2009, 91 (01) : 123 - 144
  • [8] SOME SMALL, MULTITAPE UNIVERSAL TURING MACHINES
    HOOPER, PK
    [J]. INFORMATION SCIENCES, 1969, 1 (02) : 205 - &
  • [9] The Complexity of Small Universal Turing Machines: A Survey
    Neary, Turlough
    Woods, Damien
    [J]. SOFSEM 2012: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2012, 7147 : 385 - +
  • [10] The complexity of small universal Turing machines: A survey
    Woods, Damien
    Neary, Turlough
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (4-5) : 443 - 450
12345