Simplicity via Provability for Universal Prefix-free Turing Machines

Universality is one of the most important ideas in computability theory. There are various criteria of simplicity for universal Turing machines. Probably the most popular one is to count the number of states/symbols. This criterion is more complex than it may appear at a first glance. In this note w...

Full description

Bibliographic Details
Main Author: Cristian S. Calude
Format: Article
Language:English
Published: Open Publishing Association 2009-06-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/0906.3235v1

Similar Items