◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Turetsky

9 papers hereh-index 366 citations18 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author1
  • last author7

Across the 8 of 9 papers where every author was matched, so the position is known.

fields
  • math.LO7
  • cs.FL1
  • math.GN1

identity via Semantic Scholar / OpenAlex

activity
20132026
most citedComputing K-Trivial Sets by Incomplete Random Sets

4 citations · 7 across the 8 of their papers we have counts for

collaborators
Showing 2017 · math.LOShow all

1 paper · 2 filters

math.LO2017

Martin-Löf reducibility and cost functions

Noam Greenberg, Joseph S. Miller, Andre Nies +1

Martin-Löf (ML)-reducibility compares K-trivial sets by examining the Martin-Löf random sequences that compute them. We show that every K-trivial set is computable from a c.e.\…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.