Zobrazeno 1 - 10
of 79
pro vyhledávání: '"Denis R. Hirschfeldt"'
Autor:
Denis R. Hirschfeldt, Sarah C. Reitzes
Publikováno v:
Notre Dame Journal of Formal Logic. 63
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a17f0b4027997bc474de0e5126ffa34d
https://doi.org/10.1215/00294527-2022-0027
https://doi.org/10.1215/00294527-2022-0027
Autor:
Rod Downey, Denis R. Hirschfeldt
The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra. Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of
Publikováno v:
Computability. 9:193-217
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b19c7ba5bb57fb17d571668e69511675
https://doi.org/10.3233/com-190251
https://doi.org/10.3233/com-190251
Autor:
Denis R. Hirschfeldt
Publikováno v:
The Journal of Symbolic Logic. 85:531-537
We show that there is a minimal pair in the nonuniform generic degrees, and hence also in the uniform generic degrees. This fact contrasts with Igusa’s result that there are no minimal pairs for relative generic computability and answers a basic st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c9b1981a6e775feaa5818a85f22d9d8
https://doi.org/10.1017/jsl.2019.77
https://doi.org/10.1017/jsl.2019.77
Autor:
Barbara F. Csima, Damir D. Dzhafarov, Denis R. Hirschfeldt, Carl G. Jockusch, Jr., Reed Solomon, Linda Brown Westrick
Publikováno v:
Computability. 8:253-263
Hindman's Theorem (HT) states that for every coloring of $\mathbb N$ with finitely many colors, there is an infinite set $H \subseteq \mathbb N$ such that all nonempty sums of distinct elements of $H$ have the same color. The investigation of restric
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ae21f00d861ee0575faf36339721904
https://doi.org/10.3233/com-180094
https://doi.org/10.3233/com-180094
Publikováno v:
Computability. 8:155-177
This paper concerns algorithms that give correct answers with (asymptotic) density $1$. A dense description of a function $g : \omega \to \omega$ is a partial function $f$ on $\omega$ such that $\left\{n : f(n) = g(n)\right\}$ has density $1$. We def
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c495dc527d67ddf6f27620546d9c1240
https://doi.org/10.3233/com-180231
https://doi.org/10.3233/com-180231
Autor:
Rodney G. Downey, Denis R. Hirschfeldt
Publikováno v:
Communications of the ACM. 62:70-80
Tracing some of the latest advancements in algorithmic randomness.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fea9b8d23564749f745e31df8b94e90d
https://doi.org/10.1145/3319408
https://doi.org/10.1145/3319408
For [Formula: see text], the coarse similarity class of [Formula: see text], denoted by [Formula: see text], is the set of all [Formula: see text] such that the symmetric difference of [Formula: see text] and [Formula: see text] has asymptotic densit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8aae1afe8d22c1f150b923d5f46daacb
Autor:
Denis R. Hirschfeldt
Publikováno v:
The Bulletin of Symbolic Logic. 22:526-530
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3be73e9796d4e185bb196b1f4f088db4
https://doi.org/10.1017/bsl.2016.32
https://doi.org/10.1017/bsl.2016.32
Publikováno v:
Computability
We consider two combinatorial principles, ${\sf{ERT}}$ and ${\sf{ECT}}$. Both are easily proved in ${\sf{RCA}}_0$ plus ${\Sigma^0_2}$ induction. We give two proofs of ${\sf{ERT}}$ in ${\sf{RCA}}_0$, using different methods to eliminate the use of ${\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::300215870e5ba85698f030ae6230d66b