MSCS
2006
13 years 10 months ago
2006
It is shown that for any 2-computably enumerable Turing degree l, any computably enumerable degree a, and any Turing degree s, if l = 0 , l < a, s 0 , and s is c.e. in a, then...
MCU
2004
14 years 8 days ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...