- ON THE NUMBER OF INFINITE SEQUENCES WITH TRIVIAL INITIAL SEGMENT COMPLEXITY
- A C.E. REAL THAT CANNOT BE SW-COMPUTED BY ANY NUMBER
- Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
- RELATIVE RANDOMNESS AND CARDINALITY GEORGE BARMPALIAS
- WORKING WITH THE LR DEGREES GEORGE BARMPALIAS, ANDREW E. M. LEWIS AND MARIYA SOSKOVA
- Algorithmic Randomness of Continuous George Barmpalias,
- HYPERSIMPLICITY AND SEMICOMPUTABILITY IN THE WEAK TRUTH TABLE DEGREES
- mlq header will be provided by the publisher h-Monotonically Computable Real Numbers
- Computability and Applications to Analysis
- K-trivial Closed Sets and Continuous Functions George Barmpalias1
- A CAPPABLE ALMOST EVERYWHERE DOMINATING COMPUTABLY ENUMERABLE DEGREE
- Algorithmic Randomness of Closed Sets George Barmpalias
- NON-CUPPING, MEASURE AND COMPUTABLY ENUMERABLE SPLITTINGS
- ON STRINGS WITH TRIVIAL KOLMOGOROV COMPLEXITY GEORGE BARMPALIAS
- THE ibT DEGREES OF COMPUTABLY ENUMERABLE SETS ARE NOT DENSE
- CHAITIN'S HALTING PROBABILITY AND THE COMPRESSION OF STRINGS USING ORACLES
- UPPER BOUNDS ON IDEALS IN THE COMPUTABLY ENUMERABLE TURING DEGREES
- LOW UPPER BOUNDS IN THE TURING DEGREES REVISITED GEORGE BARMPALIAS AND ANDRE NIES
- ELEMENTARY DIFFERENCES BETWEEN THE DEGREES OF UNSOLVABILITY AND DEGREES OF COMPRESSIBILITY
- COMPACTNESS ARGUMENTS WITH EFFECTIVELY CLOSED SETS FOR THE STUDY OF RELATIVE RANDOMNESS.
- PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY
- WORKING WITH STRONG REDUCIBILITIES ABOVE TOTALLY -C.E. DEGREES
- The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000
- POST'S PROGRAMME FOR THE ERSHOV HIERARCHY BAHAREH AFSHARI, GEORGE BARMPALIAS,
- RANDOMNESS AND THE LINEAR DEGREES OF COMPUTABILITY
- RANDOM REALS AND LIPSCHITZ CONTINUITY ANDREW E.M. LEWIS AND GEORGE BARMPALIAS
- APPROXIMATION REPRESENTATIONS FOR REALS AND THEIR wtt-DEGREES
- A trans nite hierarchy of reals George Barmpalias
- K-TRIVIALS ARE NEVER CONTINUOUSLY RANDOM GEORGE BARMPALIAS, NOAM GREENBERG, ANTONIO MONTALBAN,
- IMMUNITY PROPERTIES AND THE n-C.E. HIERARCHY BAHAREH AFSHARI, GEORGE BARMPALIAS, AND S. BARRY COOPER
- RANDOMNESS NOTIONS AND PARTIAL RELATIVIZATION GEORGE BARMPALIAS, JOSEPH S. MILLER, AND ANDRE NIES
- K-Triviality of Closed Sets and Continuous George Barmpalias, School of Mathematics,
- TRACING AND DOMINATION IN THE TURING GEORGE BARMPALIAS
- On the Monotonic Computability of Semi-Computable Real Numbers
- 1 CLASSES, LR DEGREES AND TURING DEGREES GEORGE BARMPALIAS, ANDREW E.M. LEWIS AND FRANK STEPHAN
- MEASURE AND CUPPING IN THE TURING DEGREES GEORGE BARMPALIAS AND ANDREW E.M. LEWIS
- THE HYPERSIMPLE-FREE C.E. WTT DEGREES ARE DENSE IN THE C.E. WTT DEGREES
- KOLMOGOROV COMPLEXITY OF INITIAL SEGMENTS OF SEQUENCES AND ARITHMETICAL DEFINABILITY
- THE IMPORTANCE OF 0 1 CLASSES IN EFFECTIVE
- APPROXIMATION REPRESENTATIONS FOR 2 REALS GEORGE BARMPALIAS
- JUMP INVERSIONS INSIDE EFFECTIVELY CLOSED SETS AND APPLICATIONS TO RANDOMNESS
- UNIVERSALITY PROBABILITY OF A PREFIX-FREE MACHINE GEORGE BARMPALIAS AND DAVID L. DOWE
- Manuel Lerman. A framework for priority arguments. Lecture Notes in Logic, vol. 34. Cambridge University Press, NY, 2010, xvi + 176 pp.
- KOLMOGOROV COMPLEXITY AND COMPUTABLY ENUMERABLE SETS
- UNIVERSAL COMPUTABLY ENUMERABLE SETS AND INITIAL SEGMENT PREFIX-FREE COMPLEXITY
- THE TYPICAL TURING DEGREE GEORGE BARMPALIAS, ADAM R. DAY, AND ANDREW E.M. LEWIS
