Structural complexity 1
Small universal Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
Small deterministic Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
Small universal register machines
Theoretical Computer Science - Special issue on universal machines and computations
Journal of Computer and System Sciences
A new kind of science
Introduction to the Theory of Computation: Preliminary Edition
Introduction to the Theory of Computation: Preliminary Edition
Membrane Computing: An Introduction
Membrane Computing: An Introduction
A Universal Turing Machine with 3 States and 9 Symbols
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Three Small Universal Turing Machines
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Small fast universal turing machines
Theoretical Computer Science
Fundamenta Informaticae
On small universal antiport P systems
Theoretical Computer Science
Four small universal turing machines
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Small semi-weakly universal turing machines
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
On the rule complexity of universal tissue p systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Computing with spiking neural p systems: traces and small universal systems
DNA'06 Proceedings of the 12th international conference on DNA Computing
Sequential p systems with unit rules and energy assigned to membranes
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Hi-index | 0.00 |
Given a computational model ${\cal M}$, and a "reasonable" encoding function ${\cal C}: {\cal M} \to \{0,1\}^\ast$ that encodes any computation device M of ${\cal M}$ as a finite bit string, we define the description size of M (under the encoding ${\cal C}$) as the length of ${\cal C}(M)$. The description size of the entire class ${\cal M}$ (under the encoding ${\cal C}$) can then be defined as the length of the shortest bit string that encodes a universal device of ${\cal M}$. In this paper we propose the description size as a complexity measure that allows to compare different computational models. We compute upper bounds to the description size of deterministic register machines, Turing machines, spiking neural P systems and UREM P systems. By comparing these sizes, we provide a first partial answer to the following intriguing question: what is the minimal (description) size of a universal computation device?