Zobrazeno 1 - 10
of 276
pro vyhledávání: '"Denis R. Hirschfeldt"'
Autor:
Eastaugh, Benedict
Publikováno v:
Studia Logica: An International Journal for Symbolic Logic, 2017 Aug 01. 105(4), 873-879.
Externí odkaz:
https://www.jstor.org/stable/45096623
Autor:
Hirst, Jeffry L.
Publikováno v:
The Bulletin of Symbolic Logic, 2015 Sep 01. 21(3), 338-339.
Externí odkaz:
https://www.jstor.org/stable/43556440
Autor:
Bienvenu, Laurent
Publikováno v:
The Bulletin of Symbolic Logic, 2012 Mar 01. 18(1), 126-128.
Externí odkaz:
https://www.jstor.org/stable/41472443
Autor:
Laurent Bienvenu
Publikováno v:
The Bulletin of Symbolic Logic. 18:126-128
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6822a492a867ac13587c668d6dbbadfe
https://doi.org/10.1017/s1079898600000263
https://doi.org/10.1017/s1079898600000263
Autor:
Jeffry L. Hirst
Publikováno v:
The Bulletin of Symbolic Logic. 21:338-339
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07cb6bc7b2bfc5044ca22c575ba914fa
https://doi.org/10.1017/bsl.2015.18
https://doi.org/10.1017/bsl.2015.18
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