×

zbMATH — the first resource for mathematics

Turetsky, Dan

Compute Distance To:
Author ID: turetsky.dan Recent zbMATH articles by "Turetsky, Dan"
Published as: Turetsky, Dan
Documents Indexed: 12 Publications since 2013

Publications by Year

Citations contained in zbMATH

9 Publications have been cited 34 times in 27 Documents Cited by Year
Computuing \(K\)-trivial sets by incomplete random sets. Zbl 1320.03074
Bienvenu, Laurent; Day, Adam R.; Greenberg, Noam; Kučera, Antonín; Miller, Joseph S.; Nies, André; Turetsky, Dan
11
2014
Coherent randomness tests and computing the \(K\)-trivial sets. Zbl 1375.03049
Bienvenu, Laurent; Greenberg, Noam; Kučera, Antonín; Nies, André; Turetsky, Dan
8
2016
Characterizing lowness for Demuth randomness. Zbl 1338.03080
Bienvenu, Laurent; Downey, Rod; Greenberg, Noam; Nies, André; Turetsky, Dan
6
2014
The finite intersection principle and genericity. Zbl 1375.03046
Diamondstone, David; Downey, Rod; Greenberg, Noam; Turetsky, Dan
3
2016
Lowness for isomorphism and degrees of genericity. Zbl 1435.03068
Franklin, Johanna N. Y.; Turetsky, Dan
2
2018
Strong jump-traceability. Zbl 06916705
Greenberg, Noam; Turetsky, Dan
1
2018
Finding bases of uncountable free abelian groups is usually difficult. Zbl 1414.03006
Greenberg, Noam; Turetsky, Dan; Westrick, Linda Brown
1
2018
A van Lambalgen theorem for Demuth randomness. Zbl 1364.03060
Diamondstone, David; Greenberg, Noam; Turetsky, Dan
1
2013
Joining non-low c.e. sets with diagonally non-computable functions. Zbl 1327.03033
Bienvenu, Laurent; Greenberg, Noam; Kučera, Antonín; Miller, Joseph S.; Nies, André; Turetsky, Dan
1
2013
Lowness for isomorphism and degrees of genericity. Zbl 1435.03068
Franklin, Johanna N. Y.; Turetsky, Dan
2
2018
Strong jump-traceability. Zbl 06916705
Greenberg, Noam; Turetsky, Dan
1
2018
Finding bases of uncountable free abelian groups is usually difficult. Zbl 1414.03006
Greenberg, Noam; Turetsky, Dan; Westrick, Linda Brown
1
2018
Coherent randomness tests and computing the \(K\)-trivial sets. Zbl 1375.03049
Bienvenu, Laurent; Greenberg, Noam; Kučera, Antonín; Nies, André; Turetsky, Dan
8
2016
The finite intersection principle and genericity. Zbl 1375.03046
Diamondstone, David; Downey, Rod; Greenberg, Noam; Turetsky, Dan
3
2016
Computuing \(K\)-trivial sets by incomplete random sets. Zbl 1320.03074
Bienvenu, Laurent; Day, Adam R.; Greenberg, Noam; Kučera, Antonín; Miller, Joseph S.; Nies, André; Turetsky, Dan
11
2014
Characterizing lowness for Demuth randomness. Zbl 1338.03080
Bienvenu, Laurent; Downey, Rod; Greenberg, Noam; Nies, André; Turetsky, Dan
6
2014
A van Lambalgen theorem for Demuth randomness. Zbl 1364.03060
Diamondstone, David; Greenberg, Noam; Turetsky, Dan
1
2013
Joining non-low c.e. sets with diagonally non-computable functions. Zbl 1327.03033
Bienvenu, Laurent; Greenberg, Noam; Kučera, Antonín; Miller, Joseph S.; Nies, André; Turetsky, Dan
1
2013

Citations by Year