Daniel Turetsky

21 papers Journal 21
YearRankTypeTitle / Venue / Authors
2025 J jnl
Computable classifications of continuous, transducer, and regular functions.
Theor. Comput. Sci.
Johanna N. Y. Franklin, Rupert Hölzl, Alexander G. Melnikov, Keng Meng Ng, Daniel Turetsky
2025 J jnl
Limit Complexities, Minimal Descriptions, and
J. Symb. Log.
Rodney G. Downey, Lu Liu, Keng Meng Ng, Daniel Turetsky
2025 J jnl
Normality, Relativization, and Randomness.
Theory Comput. Syst.
Wesley Calvert, Emma Gruner, Elvira Mayordomo, Daniel Turetsky, Java Darleen Villano
2023 J jnl
Normality, Relativization, and Randomness.
CoRR
Wesley Calvert, Emma Gruner, Elvira Mayordomo, Daniel Turetsky, Java Darleen Villano
2020 J jnl
Graphs are not universal for online computability.
J. Comput. Syst. Sci.
Rodney G. Downey, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Daniel Turetsky
2020 J jnl
Punctual Categoricity and Universality.
J. Symb. Log.
Rod Downey, Noam Greenberg, Alexander G. Melnikov, Keng Meng Ng, Daniel Turetsky
2019 J jnl
Computability-theoretic categoricity and Scott families.
Ann. Pure Appl. Log.
Ekaterina B. Fokina, Valentina S. Harizanov, Daniel Turetsky
2019 J jnl
Effective aspects of algorithmically random structures.
Comput.
Matthew Harrison-Trainor, Bakh Khoussainov, Daniel Turetsky
2018 J jnl
Two More Characterizations of
Notre Dame J. Formal Log.
Noam Greenberg, Joseph S. Miller, Benoit Monin, Daniel Turetsky
2018 J jnl
Uniform Procedures in uncountable Structures.
J. Symb. Log.
Noam Greenberg, Alexander G. Melnikov, Julia F. Knight, Daniel Turetsky
2016 J jnl
Linear Orders Realized by C.E. Equivalence Relations.
J. Symb. Log.
Ekaterina B. Fokina, Bakhadyr Khoussainov, Pavel Semukhin, Daniel Turetsky
2015 J jnl
Computability and uncountable Linear Orders I: Computable Categoricity.
J. Symb. Log.
Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel Turetsky
2015 J jnl
Partial functions and domination.
Log. Methods Comput. Sci.
C. T. Chong, Gordon Hoi, Frank Stephan, Daniel Turetsky
2014 J jnl
Characterizing Lowness for Demuth Randomness.
J. Symb. Log.
Laurent Bienvenu, Rod Downey, Noam Greenberg, André Nies, Daniel Turetsky
2013 J jnl
Galvin's "Racing Pawns" Game, Internal Hyperarithmetic Comprehension, and the Law of Excluded Middle.
Notre Dame J. Formal Log.
Chris J. Conidis, Noam Greenberg, Daniel Turetsky
2013 J jnl
Joining non-low C.E. sets with diagonally non-computable functions.
J. Log. Comput.
Laurent Bienvenu, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Daniel Turetsky
2013 J jnl
Natural Large Degree Spectra.
Comput.
David Diamondstone, Noam Greenberg, Daniel Turetsky
2012 J jnl
A K-trivial set which is not jump traceable at certain orders.
Inf. Process. Lett.
Daniel Turetsky
2011 J jnl
Connectedness properties of dimension level sets.
Theor. Comput. Sci.
Daniel Turetsky
2010 J jnl
Decidability and Computability of Certain Torsion-Free Abelian Groups.
Notre Dame J. Formal Log.
Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky
2010 J jnl
Limitwise monotonic functions, sets, and degrees on computable domains.
J. Symb. Log.
Asher M. Kach, Daniel Turetsky