Ушбу иш иқтибос қилган ишлар

16 та иш

Иш: On Infinite Direct Sums of Minimal Numberings of Functional Families

Recursively Enumerable Sets and Degrees
Robert I. Soare
Китоб198710 иқтибос
ABI
Theory of Numberings
Yuri L. Ershov
Боб19996 иқтибос
ABI
On decomposition of Gödelnumberings into Friedbergnumberings
Britta Schinzel
Мақола19824 иқтибос
ABI
Effectively infinite classes of numberings and computable families of reals
M. Kh. Faĭzrahmanov, Z. K. Shchedrikova
Мақола20234 иқтибос
ABI
Algorithmic Randomness and Complexity
Rodney G. Downey, Denis R. Hirschfeldt
Китоб20102 иқтибос
ABI
Arithmetic complexity via effective names for random sequences
Bjørn Kjos-Hanssen, Frank Stephan, Jason Teutsch
Мақола20122 иқтибос
ABI
Things that can be made into themselves
Frank Stephan, Jason Teutsch
Мақола20142 иқтибос
ABI
Enumeration of families of general recursive functions
Yu. L. Ershov
Мақола19672 иқтибос
ABI
The computable enumerations of families of general recursive functions
С. С. Марченков
Мақола19722 иқтибос
ABI
Limitwise monotonic sets of reals
M. Kh. Faĭzrahmanov, I. Sh. Kalimullin
Мақола20152 иқтибос
ABI
Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
R. Friedberg
Мақола19582 иқтибос
ABI
Numberings and Randomness
Paul Brodhead, Bjørn Kjos-Hanssen
Боб20092 иқтибос
ABI
Reductions between types of numberings
Ian Herbert, Sanjay Jain, Steffen Lempp +2
Мақола20192 иқтибос
ABI
Numberings and randomness
Brodhead, Katie, Kjos-Hanssen, Bjørn
Боб20142 иқтибос
ABI
Сарлавҳасиз
Бошқа2 иқтибос
ABI
Positive enumerations
S. A. Badaev
Мақола19772 иқтибос
ABI