3 search results - page 1 / 1 » A measure-theoretic proof of Turing incomparability |
APAL
2010
13 years 4 months ago
2010
We prove that if S is an -model of weak weak K
MCU
2004
13 years 6 months 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...
APAL
2010
13 years 4 months ago
2010
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-K...