Computer Science – Computational Complexity
Scientific paper
2009-06-17
EPTCS 1, 2009, pp. 118-122
Computer Science
Computational Complexity
Scientific paper
10.4204/EPTCS.1.11
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.
No associations
LandOfFree
Some Considerations on Universality does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Some Considerations on Universality, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some Considerations on Universality will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-223403