2000 character limit reached
Some Considerations on Universality (0906.3199v1)
Published 17 Jun 2009 in cs.CC and cs.FL
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.