Some Considerations on Universality
Computational Complexity
2009-06-23 v1 Formal Languages and Automata Theory
Abstract
The paper puts into discussion the concept of universality, in particular for structures not of the power of Turing computability. The question arises if for such structures a universal structure of the same kind exists or not. For that the construction of universal Turing machines and those with some constraints are presented in some detail.
Keywords
Cite
@article{arxiv.0906.3199,
title = {Some Considerations on Universality},
author = {Manfred Kudlek},
journal= {arXiv preprint arXiv:0906.3199},
year = {2009}
}