Joseph S. Miller

Orcid: 0000-0002-6411-5670

Affiliations:
  • University of Wisconsin-Madison, Wisconsin, USA


According to our database1, Joseph S. Miller authored at least 50 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Enumerations of families closed under finite differences.
Comput., 2024

2023
Maximal Towers and Ultrafilter Bases in Computability Theory.
J. Symb. Log., 2023

Pa Relative to an Enumeration Oracle.
J. Symb. Log., 2023

Expanding the Reals by continuous Functions Adds no Computational Power.
J. Symb. Log., 2023

Minimal covers in the Weihrauch degrees.
CoRR, 2023

2022
A Structural Dichotomy in the Enumeration Degrees.
J. Symb. Log., 2022

Computability and the Symmetric Difference Operator.
Log. J. IGPL, 2022

2020
Chaitin's ω as a continuous function.
J. Symb. Log., 2020

Computing from projections of random points.
J. Math. Log., 2020

2019
Connected choice and the Brouwer fixed point theorem.
J. Math. Log., 2019

2018
Dimension 1 sequences are close to randoms.
Theor. Comput. Sci., 2018

Two More Characterizations of <i>K</i>-Triviality.
Notre Dame J. Formal Log., 2018

Corrigendum to "Advice classes of parameterized tractability" [Ann. Pure Appl. Logic 84 (1) (1997) 119-138].
Ann. Pure Appl. Log., 2018

2017
Forcing with Bushy Trees.
Bull. Symb. Log., 2017

Nullifying randomness and genericity using symmetric difference.
Ann. Pure Appl. Log., 2017

On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals.
Proceedings of the Computability and Complexity, 2017

2016
The complements of Lower cones of Degrees and the degree spectra of Structures.
J. Symb. Log., 2016

On Kalimullin pairs.
Comput., 2016

The Brouwer Fixed Point Theorem Revisited.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015
Counting the changes of random Δ20 sets.
J. Log. Comput., 2015

Energy randomness.
CoRR, 2015

2014
Universal computably Enumerable Equivalence Relations.
J. Symb. Log., 2014

Lowness for effective Hausdorff dimension.
J. Math. Log., 2014

Denjoy, Demuth and density.
J. Math. Log., 2014

Random strings and tt-degrees of Turing complete C.E. sets.
Log. Methods Comput. Sci., 2014

Computing k-Trivial Sets by Incomplete Random Sets.
Bull. Symb. Log., 2014

The degrees of bi-hyperhyperimmune sets.
Ann. Pure Appl. Log., 2014

2013
Joining non-low C.E. sets with diagonally non-computable functions.
J. Log. Comput., 2013

2012
Lowness notions, measure and domination.
J. Lond. Math. Soc., 2012

Randomness and lowness notions via open covers.
Ann. Pure Appl. Log., 2012

The Denjoy alternative for computable functions.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

2011
Randomness and Differentiability.
CoRR, 2011

2010
Counting the Changes of Random D<sup>0</sup><sub>2</sub> Sets.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009
The <i>K</i>-Degrees, Low for <i>K</i> Degrees, and Weakly Low for <i>K</i> Sets.
Notre Dame J. Formal Log., 2009

Indifferent Sets.
J. Log. Comput., 2009

Lowness for Kurtz randomness.
J. Symb. Log., 2009

2008
The upward closure of a perfect thin class.
Ann. Pure Appl. Log., 2008

2006
Every 1-generic computes a properly 1-generic.
J. Symb. Log., 2006

Uniform almost everywhere domination.
J. Symb. Log., 2006

Randomness and halting probabilities.
J. Symb. Log., 2006

Randomness and Computability: Open Questions.
Bull. Symb. Log., 2006

Kolmogorov-Loveland randomness and stochasticity.
Ann. Pure Appl. Log., 2006

On self-embeddings of computable linear orderings.
Ann. Pure Appl. Log., 2006

2005
The Undecidability of Iterated Modal Relativization.
Stud Logica, 2005

Relativizing Chaitin's Halting Probability.
J. Math. Log., 2005

2004
Every 2-random real is Kolmogorov random.
J. Symb. Log., 2004

Degrees of unsolvability of continuous functions.
J. Symb. Log., 2004

Effectiveness for infinite variable words and the Dual Ramsey Theorem.
Arch. Math. Log., 2004

2002
Effectiveness for Embedded Spheres and Balls.
Proceedings of the Computability and Complexity in Analysis, 2002

2000
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata.
Proceedings of the Hybrid Systems: Computation and Control, Third International Workshop, 2000


  Loading...