- HIGHER KURTZ RANDOMNESS BJRN KJOS-HANSSEN, ANDRE NIES, FRANK STEPHAN, AND LIANG YU
- CHARACTERIZING THE STRONGLY JUMP-TRACEABLE SETS VIA RANDOMNESS
- Superhighness and strong jump traceability Andre Nies
- Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010
- UPPER BOUNDS ON IDEALS IN THE COMPUTABLY ENUMERABLE TURING DEGREES
- Author's Personal Copy Annals of Pure and Applied Logic 162 (2011) 504513
- SUPERHIGHNESS BJRN KJOS-HANSSEN AND ANDRE NIES
- UNIVERSAL RECURSIVELY ENUMERABLE SETS OF STRINGS
- RANDOMNESS VIA EFFECTIVE DESCRIPTIVE SET THEORY 1 An analog of ML-randomness in the effective descriptive set theory setting is studied, where the
- CALIBRATING RANDOMNESS ROD DOWNEY, DENIS R. HIRSCHFELDT, ANDRE NIES,
- Lowness properties and randomness Andre Nies
- Lowness Properties and Approximations of the Jump
- Electronic Notes in Theoretical Computer Science 84 (2003) URL: http://www.elsevier.nl/locate/entcs/volume84.html 7 pages
- Randomness, relativization and Turing degrees Andre Nies, Frank Stephan and Sebastiaan A. Terwijn
- Low for random sets: the story Andre Nies
- BOREL STRUCTURES: A BRIEF SURVEY ANTONIO MONTALBAN AND ANDRE NIES
- The Journal of Symbolic Logic Volume 76, Number 2, June 2011
- Finite automata presentable abelian groups Andre Nies1
- J. Group Theory a (2006), 115 DOI 10.1515/JGT.2006.aaa
- Automatic Structures: Richness and Limitations Bakhadyr Khoussainov
- Submitted exclusively to the London Mathematical Society DOI: 10.1112/S0000000000000000
- The first order theories of the Medvedev and the Muchnik lattice
- Parameter definability in the recursively enumerable degrees
- Contemporary Mathematics Effectively dense Boolean algebras
- CALCULUS OF COST FUNCTIONS ANDRE NIES
- Lowness for computable and partial computable randomness Andre Nies
- April 12, 2006 Master Review Vol. 9in x 6in (for Lecture Note Series, IMS, NUS) wttdimensionimsfinal A lower cone in the wtt degrees of non-integral effective
- Structural properties and \Sigma 0 2 enumeration
- A Uniformity of Degree Structures \Lambda Andr'e Nies
- Journal of Mathematical Logic, Vol. 5, No. 2 (2005) 167192 c World Scientific Publishing Company
- Indifferent sets Santiago Figueira 1
- Kolmogorov-Loveland Randomness and Stochasticity
- Intervals of the lattice of computably enumerable sets and effective boolean algebras
- April 30, 2006 Master Review Vol. 9in x 6in (for Lecture Note Series, IMS, NUS) NiesIMSpaper Eliminating concepts
- BENIGN COST FUNCTIONS AND LOWNESS PROPERTIES NOAM GREENBERG AND ANDRE NIES
- Research Report Chaitin# Numbers and
- HIGHER RANDOMNESS NOTIONS AND THEIR LOWNESS PROPERTIES
- Interpreting N in the computably enumerable weak truth table degrees
- CHARACTERIZING THE STRONGLY JUMP-TRACEABLE SETS VIA RANDOMNESS
- Algebra Universalis, 35 (1996) 8-33 0002 5240/96/010008 26501.50 + 0.20/0 ~) 1996 Birkh/iuser Verlag, Basel
- Reals which compute little Andre Nies
- LOWNESS AND 0 ROD DOWNEY, ANDRE NIES, REBECCA WEBER, AND LIANG YU
- June 1, 2006 Master Review Vol. 9in x 6in (for Lecture Note Series, IMS, NUS) totalmachines Publishers' page
- Recursive Models of Theories with Few Models Bakhadyr Khoussainov \Lambda
- ATOMLESS rMAXIMAL SETS PETER A. CHOLAK AND ANDR
- Counting the changes of random 0 Santiago Figueira1
- ! " # $ % $ & " & $ ' ( ) ) 0 1 2 $ 3 & 4 ( 5 2 67 8 $ 7 )
- Studying randomness through computation Andre Nies
- LOWNESS FOR THE CLASS OF SCHNORR RANDOM REALS
- PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY
- Branching in the enumeration degrees of the Andr'e Nies \Lambda Andrea Sorbi y
- FA-presentable Groups and Rings Andre Nies a
- Kolmogorov-Loveland Randomness and Stochasticity
- Initial segments of the lattice of \Pi 0 Douglas Cenzer
- Differences of computably enumerable sets Steffen Lempp \Lambda
- ON THE FILTER OF COMPUTABLY ENUMERABLE SUPERSETS OF AN RMAXIMAL SET
- Noninterpretability of infinite linear orders Wilfrid Hodges, Queen Mary and Westfield College
- Computably enumerable sets below random sets
- Separating classes of groups by rst{order sentences Andr e Nies
- Relativization of Structures Arising from Computability Theory Andr'e Nies
- Undecidability Results for Low Complexity Time Classes \Lambda
- The -Theory of R(, , ) is Undecidable Russell G. Miller
- Category theory Heather Macbeth
- Context-sensitive Languages and Linear Bounded Andre Nies, Supervisor
- Reading Paper 381 Report ZFC Set Theory and the Category of Sets
- Logical Methods in Computer Science Vol. 3 (2:2) 2007, pp. 118
- The origin of topoi in category theory came from the Grothendieck school of algebraic geometry. In the 1950s Grothendieck had introduced the idea of an
- DEMUTH'S PATH TO ALGORITHMIC RANDOMNESS ANTONIN KUCERA AND ANDRE NIES
- RANDOMNESS AND DIFFERENTIABILITY VASCO BRATTKA, JOSEPH S. MILLER, AND ANDRE NIES
- Automatic groups and Thompson's group F Supervisors: Bakhadyr Khoussainov and Andre Nies
- Solovay functions and K-triviality Laurent Bienvenu1
- The -Theory of R(, , ) Is Undecidable Author(s): Russell G. Miller, Andre O. Nies, Richard A. Shore
- INTERVALS OF THE LATTICE OF COMPUTABLY ENUMERABLE SETS AND EFFECTIVE
- PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY
- ISRAEL JOURNAL OF MATHEMATICS xxx (2013), 126 DOI: 10.1007/s11856 000000000000000
- Structural Properties and 02 Enumeration Degrees Author(s): Andr Nies and Andrea Sorbi
- Noninterpretability of infinite linear orders Wilfrid Hodges, Queen Mary and Westfield College
- TRANSACTIONS OF THE AMERICAN MATHEMAT`ICAL SOCIETY
- The Undecidability of the 4theory for the r.e. wtt-and Turingdegrees
- Journal of Algebra 320 (2008) 569585 www.elsevier.com/locate/jalgebra
- A Uniformity of Degree Structures We isolate a fact which holds for various degree structures arising from
