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 条
12345