Dan Turetsky

Available identifiers

zbMath Open turetsky.danMaRDI QIDQ277529

List of research outcomes

Publication	Date of Publication	Type
Iterated priority arguments in descriptive set theory	2024-11-12	Paper
Martin-Löf reducibility and cost functions	2024-06-25	Paper
Enumerations of families closed under finite differences	2024-04-15	Paper
STRUCTURAL HIGHNESS NOTIONS	2023-12-22	Paper
Iterated Priority Arguments in Descriptive Set Theory	2022-11-15	Paper
An Effective Classification of Borel Wadge Classes	2022-11-15	Paper
Relationships between computability-theoretic properties of problems	2022-04-12	Paper
SCOTT COMPLEXITY OF COUNTABLE STRUCTURES	2022-01-17	Paper
Computing sets from all infinite subsets	2021-10-21	Paper
Non-density in punctual computability	2021-07-26	Paper
Coding in the automorphism group of a computably categorical structure	2021-05-19	Paper
Taking the path computably traveled	2020-01-29	Paper
Cardinal invariants, non-lowness classes, and Weihrauch reducibility	2020-01-17	Paper
The Rado path decomposition theorem	2019-12-17	Paper
Relationships between computability-theoretic properties of problems	2019-03-11	Paper
Strong jump-traceability	2018-08-13	Paper
Finding bases of uncountable free abelian groups is usually difficult	2018-03-28	Paper
Lowness for isomorphism and degrees of genericity	2018-03-16	Paper
The finite intersection principle and genericity	2017-09-28	Paper
A van Lambalgen theorem for Demuth randomness	2017-05-31	Paper
Coherent randomness tests and computing the \(K\)-trivial sets	2016-05-02	Paper
Computuing \(K\)-trivial sets by incomplete random sets	2014-10-21	Paper
Characterizing lowness for Demuth randomness	2014-09-30	Paper
Joining non-low C.E. sets with diagonally non-computable functions	2014-04-01	Paper

Research outcomes over time

This page was built for person: Dan Turetsky