- A BASIS THEOREM FOR 1 CLASSES OF POSITIVE MEASURE
- LOWNESS FOR KURTZ RANDOMNESS NOAM GREENBERG AND JOSEPH S. MILLER
- EXTRACTING INFORMATION IS HARD: A TURING DEGREE OF NON-INTEGRAL
- EVERY 2-RANDOM REAL IS KOLMOGOROV RANDOM JOSEPH S. MILLER
- Randomness via effective descriptive set theory The University of Auckland
- Joseph S. Miller Lawrence S. Moss
- hence no Cohengen/MLrandom weaklydistr ccc forcing)
- Electronic Notes in Theoretical Computer Science 66 No. 1 (2003) URL: http://www.elsevier.nl/locate/entcs/volume66.html 12 pages
- PROMPT SIMPLICITY, ARRAY COMPUTABILITY AND ROD DOWNEY, NOAM GREENBERG, JOSEPH S. MILLER, AND REBECCA WEBER
- EVERY 1GENERIC COMPUTES A PROPERLY 1GENERIC BARBARA F. CSIMA, ROD DOWNEY, NOAM GREENBERG, DENIS R. HIRSCHFELDT,
- Randomness and Halting Probabilities Veronica Becher
- %! Polyglottal Quine TeX and PostScript: Joseph S. Miller {\def\]#1{}\](%)}/Courier findfont 10 scalefont setfont newpath{
- PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY
- THE UPWARD CLOSURE OF A PERFECT THIN CLASS ROD DOWNEY, NOAM GREENBERG, AND JOSEPH S. MILLER
- DEGREE SPECTRA OF UNARY RELATIONS ON , ROD DOWNEY, BAKHADYR KHOUSSAINOV, JOSEPH S. MILLER, AND LIANG YU
- THE K-DEGREES, LOW FOR K DEGREES, AND WEAKLY LOW FOR K SETS
- Indifferent sets Santiago Figueira 1
- RANDOMNESS AND DIFFERENTIABILITY VASCO BRATTKA, JOSEPH S. MILLER, AND ANDRE NIES
- Counting the changes of random 0 Santiago Figueira1
- Randomness and lowness notions via open covers
- March 12, 2011 DIAGONALLY NON-RECURSIVE FUNCTIONS AND
- CONTRASTING PLAIN AND PREFIX-FREE KOLMOGOROV COMPLEXITY
- UNIFORM ALMOST EVERYWHERE DOMINATION PETER CHOLAK, NOAM GREENBERG, AND JOSEPH S. MILLER
- On Self-Embeddings of Computable Linear Orderings
- Kolmogorov-Loveland Randomness and Stochasticity
- RELATIVIZING CHAITIN'S HALTING PROBABILITY ROD DOWNEY, DENIS R. HIRSCHFELDT, JOSEPH S. MILLER, AND ANDRE NIES
- DEGREES OF UNSOLVABILITY OF CONTINUOUS FUNCTIONS JOSEPH S. MILLER
- Decidability and Complexity Results for Timed Automata and
- RANDOMNESS, COMPUTABILITY AND INFORMATION JOSEPH S. MILLER
- (NP-cap-coNP)/poly EESPACEEEXP
- Kolmogorov-Loveland Randomness and Stochasticity
- Answers to Exercises for Andre's FRG Nicholas Rupprecht
- ON INITIAL SEGMENT COMPLEXITY AND DEGREES OF RANDOMNESS
- EFFECTIVENESS FOR INFINITE VARIABLE WORDS AND THE DUAL RAMSEY THEOREM
- Randomness and Halting Probabilities Ver'onica Becher * Santiago Figueira * Serge Grigorieff y
- EVERY 2-RANDOM REAL IS KOLMOGOROV RANDOM JOSEPH S. MILLER
- On Self-Embeddings of Computable Linear Orderings ?
- DEGREES OF UNSOLVABILITY OF CONTINUOUS FUNCTIONS JOSEPH S. MILLER
- Kolmogorov-Loveland Randomness and Stochasticity
- Electronic Notes in Theoretical Computer Science 66 No. 1 (2006) URL: http://www.elsevier.nl/locate/entcs/volume66.html 12 pages
- A BASIS THEOREM FOR 01CLASSES OF POSITIVE MEASURE
- ON INITIAL SEGMENT COMPLEXITY AND DEGREES OF RANDOMNESS
- Joseph S. Miller The Undecidability of Lawrence S. Moss Iterated Modal
- OSCILLATION IN THE INITIAL SEGMENT COMPLEXITY OF RANDOM REALS
- PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY
- RANDOMNESS FOR NON-COMPUTABLE MEASURES ADAM R. DAY AND JOSEPH S. MILLER
- LOWNESS NOTIONS, MEASURE AND DOMINATION BJRN KJOS-HANSSEN, JOSEPH S. MILLER, AND REED SOLOMON
- UNIFORM ALMOST EVERYWHERE DOMINATION PETER CHOLAK, NOAM GREENBERG, AND JOSEPH S. MILLER
- Decidability and Complexity Results for Timed Automata and
- EFFECTIVENESS FOR INFINITE VARIABLE WORDS AND THE DUAL RAMSEY THEOREM
- DEGREE SPECTRA OF UNARY RELATIONS ON ROD DOWNEY, BAKHADYR KHOUSSAINOV, JOSEPH S. MILLER, AND LIANG YU
- PROMPT SIMPLICITY, ARRAY COMPUTABILITY AND CUPPING
- THE UPWARD CLOSURE OF A PERFECT THIN CLASS ROD DOWNEY, NOAM GREENBERG, AND JOSEPH S. MILLER
- CONTRASTING PLAIN AND PREFIX-FREE KOLMOGOROV COMPLEXITY
- RELATIVIZING CHAITIN'S HALTING PROBABILITY ROD DOWNEY, DENIS R. HIRSCHFELDT, JOSEPH S. MILLER, AND ANDR'E NIES
- Math 222 Exam 1 Fall 2010 Select your discussion section
- Math 222 Exam 2 Fall 2010 Select your discussion section
- SOME TOPOLOGICAL RESULTS ON ULTRAFILTERS
- SATURATION PROPERTIES IN THE COMPUTABLY ENUMERABLE
- INDEPENDENCE FROM CARDINAL ARITHMETIC AND
- COMPLETELY MITOTIC TURING DEGREES, JUMP CLASSES,
- NONSTANDARD STOCHASTIC MATCHING PROCESSES AND
- STRONG LAWS IN FINITE MODEL Wafik Boulos Lotfallah
- TOPICS IN COMBINATORIAL GAMES J. Mark Ettinger
- A SET-THEORETIC APPROACH TO SOME PROBLEMS IN MEASURE THEORY
- HOMOGENEITY PROPERTIES ON COMPACT SPACES
- Hypergraphs and Chromatic Numbers, with Applications to the Bohr Topology
- Effective Algebra and Effective Dimension Daniel Turetsky
- OUTER MODEL THEORY AND THE DEFINABILITY OF FORCING
- Between O and Ostaszewski Erik Andrejko
- Characterizing the Computable Structures: Boolean Algebras and Linear Orders
- Math 431 Exam 1 (with answers) Spring 2012 1. A fair die is rolled 20 times.
- GEOMETRIC PARTITIONS OF DEFINABLE SETS AND
- Boolean Indexed Models and Wheeler's Benjamin J. Ellison
- The Denjoy alternative for computable functions Laurent Bienvenu1
- LECTURES IN HARMONIC ANALYSIS IN HONOR OF PROFESSOR STEPHEN WAINGER
- Decidability and Definability in the 2-Enumeration Degrees
- QUANTIFIER ELIMINATION FOR A CLASS OF
- AP Credits/High School Courses/Transfer 1. AP Calculus Credits
- TO BRANCH OR NOT TO BRANCH Branching and non-branching in the
- A Preparation Theorem for Weierstrass Daniel J. Miller
- Elliptic Differential Equations and their Discretizations
- ORDER-THEORETIC INVARIANTS IN SET-THEORETIC TOPOLOGY
- RELATIVE RANDOMNESS VIA RK-REDUCIBILITY
- MADNESS AND SET THEORY Dilip Raghavan
- Common Math Tracking Courses Traditional Courses
- HIGHER-ORDER REVERSE TOPOLOGY James Hunter
