Available identifiers
zbMath Open turetsky.daniel-dMaRDI QIDQ592858
List of research outcomes
| Publication | Date of Publication | Type |
|---|
| Normality, Relativization, and Randomness | 2023-12-15 | Paper |
| Limit Complexities, Minimal Descriptions, and $n$-Randomness | 2022-08-05 | Paper |
| Completeness of the hyperarithmetic isomorphism equivalence relation | 2022-05-31 | Paper |
| PUNCTUAL CATEGORICITY AND UNIVERSALITY | 2021-04-15 | Paper |
| Computable classifications of continuous, transducer, and regular functions | 2020-10-19 | Paper |
| Realizing Computably Enumerable Degrees in Separating Classes | 2020-08-23 | Paper |
| Graphs are not universal for online computability | 2020-06-09 | Paper |
| Effective aspects of algorithmically random structures | 2020-01-17 | Paper |
| Degree spectra of structures relative to equivalences | 2019-12-06 | Paper |
| Computability-theoretic categoricity and Scott families | 2019-04-30 | Paper |
| Effectively closed subgroups of the infinite symmetric group | 2018-10-23 | Paper |
| UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES | 2018-08-10 | Paper |
| Two more characterizations of \(K\)-triviality | 2018-05-18 | Paper |
| Martin-L\"of reducibility and cost functions | 2017-07-02 | Paper |
| LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS | 2016-08-19 | Paper |
| Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations | 2016-01-13 | Paper |
| COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY | 2015-05-20 | Paper |
| COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA | 2015-05-20 | Paper |
| Lowness for effective Hausdorff dimension | 2015-03-03 | Paper |
| Inherent enumerability of strong jump-traceability | 2015-02-02 | Paper |
| The complexity of computable categoricity | 2014-11-17 | Paper |
| Randomness and differentiability in higher dimensions | 2014-10-30 | Paper |
| Strong jump-traceability and Demuth randomness | 2014-04-25 | Paper |
| Natural Large Degree Spectra | 2013-10-10 | Paper |
| LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS | 2013-06-03 | Paper |
| Computable categoricity versus relative computable categoricity | 2013-05-10 | Paper |
| Galvin's ``racing pawns game, internal hyperarithmetic comprehension, and the law of excluded middle | 2013-04-25 | Paper |
| A \(K\)-trivial set which is not jump traceable at certain orders | 2012-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3091709 | 2011-09-12 | Paper |
| Connectedness properties of dimension level sets | 2011-07-14 | Paper |
| Decidability and computability of certain torsion-free abelian groups | 2010-06-11 | Paper |
| Limitwise monotonic functions, sets, and degrees on computable domains | 2010-03-15 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
This page was built for person: Daniel D. Turetsky
