Denis R. Hirschfeldt

Computer Science · Physical Sciences

21h-index2.4kcitations102works0.02yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computability, Logic, AI Algorithms(83), semigroups and automata theory(44), Advanced Topology and Set Theory(28), Benford’s Law and Fraud Detection(23), Cellular Automata and Applications(14)

Publications102 total

The Complexity of the Set of Validities of a Theory
arXiv (Cornell University)·2025Open Access
Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics
Journal of Mathematical Logic·2023· 2 cited
Thin Set Versions of Hindman’s Theorem
Notre Dame Journal of Formal Logic·2022
Reduction games, provability and compactness
Journal of Mathematical Logic·2022· 6 cited
Thin Set Versions of Hindman's Theorem
arXiv (Cornell University)·2022Open Access
A Feiner Look at the Intermediate Degrees
arXiv (Cornell University)·2021Open Access
Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics
arXiv (Cornell University)·2021· 1 citedOpen Access
Reduction games, provability, and compactness
arXiv (Cornell University)·2020· 2 citedOpen Access
Some results concerning the SRT 2 2 vs. COH problem
Computability·2020· 3 citedOpen Access
Ramsey’s theorem and products in the Weihrauch degrees
Computability·2020· 6 citedOpen Access
Combinatorial principles equivalent to weak induction
Computability·2019· 4 cited
Computability and Randomness
Notices of the American Mathematical Society·2019· 8 citedOpen Access
Dense computability, upper cones, and minimal pairs
Computability·2019· 2 citedOpen Access
Algorithmic randomness
Communications of the ACM·2019· 12 cited
Some results concerning the $\mathsf{SRT}^2_2$ vs. $\mathsf{COH}$ problem
arXiv (Cornell University)·2019· 1 citedOpen Access
Combinatorial principles equivalent to weak induction
arXiv (Cornell University)·2018Open Access
The reverse mathematics of Hindman’s Theorem for sums of exactly two elements
Computability·2018Open Access
Ramsey's theorem and products in the Weihrauch degrees
arXiv (Cornell University)·2018· 1 citedOpen Access
The reverse mathematics of Hindman's theorem for sums of exactly two\n elements
arXiv (Cornell University)·2018Open Access
Preface
Theory of Computing Systems·2018Open Access
page 1 of 6Next →

Frequent Co-authors

André Nies(9), Rod Downey(9), Rodney G. Downey(7), Richard A. Shore(6), Theodore A. Slaman(4), Carl G. Jockusch(4), Steffen Lempp(4), Bakhadyr Khoussainov(3), Joseph S. Miller(3), Sebastiaan A. Terwijn(2), C. T. Chong(2), Yue Yang(2), Bakh Khoussainov(2), Reed Solomon(2), Barbara F. Csima(2), Robert I. Soare(2), Noam Greenberg(2), Timothy H. McNicholl(2), Santiago Figueira(2), Keng Meng Ng(2)