Daniel Turetsky

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 10

Top Topics

Equivalence Relation

Top Venues

J. Comput. Syst. Sci.

Ann. Pure Appl. Log.

Publications

Wesley Calvert, Emma Grunner, Elvira Mayordomo, Daniel Turetsky, Java Darleen Villano
Normality, Relativization, and Randomness. CoRR (2023)
Rod Downey, Noam Greenberg, Alexander G. Melnikov, Keng Meng Ng, Daniel Turetsky
Punctual Categoricity and Universality. J. Symb. Log. 85 (4) (2020)
Rodney G. Downey, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Daniel Turetsky
Graphs are not universal for online computability. J. Comput. Syst. Sci. 112 (2020)
Matthew Harrison-Trainor, Bakh Khoussainov, Daniel Turetsky
Effective aspects of algorithmically random structures. Comput. 8 (3-4) (2019)
Ekaterina B. Fokina, Valentina S. Harizanov, Daniel Turetsky
Computability-theoretic categoricity and Scott families. Ann. Pure Appl. Log. 170 (6) (2019)
Noam Greenberg, Alexander G. Melnikov, Julia F. Knight, Daniel Turetsky
Uniform Procedures in uncountable Structures. J. Symb. Log. 83 (2) (2018)
Noam Greenberg, Joseph S. Miller, Benoit Monin, Daniel Turetsky
-Triviality. Notre Dame J. Formal Log. 59 (2) (2018)
Ekaterina B. Fokina, Bakhadyr Khoussainov, Pavel Semukhin, Daniel Turetsky
Linear Orders Realized by C.E. Equivalence Relations. J. Symb. Log. 81 (2) (2016)
C. T. Chong, Gordon Hoi, Frank Stephan, Daniel Turetsky
Partial functions and domination. Log. Methods Comput. Sci. 11 (3) (2015)
Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel Turetsky
Computability and uncountable Linear Orders I: Computable Categoricity. J. Symb. Log. 80 (1) (2015)
Laurent Bienvenu, Rod Downey, Noam Greenberg, André Nies, Daniel Turetsky
Characterizing Lowness for Demuth Randomness. J. Symb. Log. 79 (2) (2014)
Laurent Bienvenu, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Daniel Turetsky
Joining non-low C.E. sets with diagonally non-computable functions. J. Log. Comput. 23 (6) (2013)
Chris J. Conidis, Noam Greenberg, Daniel Turetsky
Galvin's "Racing Pawns" Game, Internal Hyperarithmetic Comprehension, and the Law of Excluded Middle. Notre Dame J. Formal Log. 54 (2) (2013)
David Diamondstone, Noam Greenberg, Daniel Turetsky
Natural Large Degree Spectra. Comput. 2 (1) (2013)
Daniel Turetsky
A K-trivial set which is not jump traceable at certain orders. Inf. Process. Lett. 112 (13) (2012)
Daniel Turetsky
Connectedness properties of dimension level sets. Theor. Comput. Sci. 412 (29) (2011)
Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky
Decidability and Computability of Certain Torsion-Free Abelian Groups. Notre Dame J. Formal Log. 51 (1) (2010)
Asher M. Kach, Daniel Turetsky
Limitwise monotonic functions, sets, and degrees on computable domains. J. Symb. Log. 75 (1) (2010)