-
1
-
-
0039681742
-
Randomness in computability theory
-
Cholak, Lempp, Lerman, Shore Contemporary Mathematics. Providence: Amer. Math. Soc
-
Ambos-Spies K., Kučcera A. Randomness in computability theory. Cholak, Lempp, Lerman, Shore. Computability Theory and its Applications. Contemporary Mathematics 257:2000;1-14 Amer. Math. Soc, Providence
-
(2000)
Computability Theory and Its Applications
, vol.257
, pp. 1-14
-
-
Ambos-Spies, K.1
Kučcera, A.2
-
5
-
-
0016532771
-
A theory of program size formally identical to information theory
-
Chaitin G. A theory of program size formally identical to information theory. Journal of the Association for Computing Machinery. 22:1975;329-340
-
(1975)
Journal of the Association for Computing Machinery
, vol.22
, pp. 329-340
-
-
Chaitin, G.1
-
6
-
-
0006892669
-
Information-theoretical characterizations of recursive infinite strings
-
Chaitin G. Information-theoretical characterizations of recursive infinite strings. Theoretical Computer Science. 2:1976;45-48
-
(1976)
Theoretical Computer Science
, vol.2
, pp. 45-48
-
-
Chaitin, G.1
-
7
-
-
84972546742
-
2 degrees and transfer theorems
-
2 degrees and transfer theorems. Illinois J. Math. 31:1987;419-427
-
(1987)
Illinois J. Math
, vol.31
, pp. 419-427
-
-
Downey, R.1
-
12
-
-
0036520623
-
Randomness, computability, and density
-
extended abstract in proceedings of STACS 2001
-
Downey R., D. Hirschfeldt, and A. Nies, Randomness, computability, and density, SIAM Journal on Computing 31 (2002) 1169-1183 (extended abstract in proceedings of STACS 2001).
-
(2002)
SIAM Journal on Computing
, vol.31
, pp. 1169-1183
-
-
Downey, R.1
Hirschfeldt, D.2
Nies, A.3
-
13
-
-
0009917430
-
Array nonrecursive sets and multiple permitting arguments
-
Ambos-Spies, Muller, Sacks Lecture Notes in Mathematics. Heidelberg: Springer-Verlag
-
Downey R., Jockusch C., Stob M. Array nonrecursive sets and multiple permitting arguments. Ambos-Spies, Muller, Sacks. Recursion Theory Week. Lecture Notes in Mathematics 1432:1990;141-174 Springer-Verlag, Heidelberg
-
(1990)
Recursion Theory Week
, vol.1432
, pp. 141-174
-
-
Downey, R.1
Jockusch, C.2
Stob, M.3
-
14
-
-
0003002645
-
Array nonrecursive degrees and genericity
-
Cooper, Slaman, Wainer London Mathematical Society Lecture Notes Series. Cambridge University Press
-
Downey R., Jockusch C., Stob M. Array nonrecursive degrees and genericity. Cooper, Slaman, Wainer. Computability, Enumerability, Unsolvability. London Mathematical Society Lecture Notes Series 224:1996;93-105 Cambridge University Press
-
(1996)
Computability, Enumerability, Unsolvability
, vol.224
, pp. 93-105
-
-
Downey, R.1
Jockusch, C.2
Stob, M.3
-
16
-
-
11844292310
-
Weak recursive degrees and a problem of Spector
-
Arslanov, & Lempp. Berlin: de Gruyter
-
Ishmukhametov S. Weak recursive degrees and a problem of Spector. Arslanov, Lempp. Recursion Theory and Complexity. 1999;81-88 de Gruyter, Berlin
-
(1999)
Recursion Theory and Complexity
, pp. 81-88
-
-
Ishmukhametov, S.1
-
19
-
-
85012630262
-
On the computational complexity of real functions
-
Ko K.-I., Friedman H. On the computational complexity of real functions. Theoretical Computer Science. 20:1982;323-352
-
(1982)
Theoretical Computer Science
, vol.20
, pp. 323-352
-
-
Ko, K.-I.1
Friedman, H.2
-
21
-
-
77956971563
-
On the use of diagonally nonrecursive functions
-
Ebbinghaus, Fernandez-Prida, Garrido, Lascar Studies in Logic and the Foundations of Mathematics. Amsterdam: North-Holland
-
Kučcera A. On the use of diagonally nonrecursive functions. Ebbinghaus, Fernandez-Prida, Garrido, Lascar. Logic Colloquium, '87. Studies in Logic and the Foundations of Mathematics 129:1989;219-239 North-Holland, Amsterdam
-
(1989)
Logic Colloquium, '87
, vol.129
, pp. 219-239
-
-
Kučcera, A.1
-
24
-
-
0009975816
-
Kolmogorov complexity and instance complexity of recursively enumerable sets
-
Kummer M. Kolmogorov complexity and instance complexity of recursively enumerable sets. SIAM Journal on Computing. 25:1996;1123-1143
-
(1996)
SIAM Journal on Computing
, vol.25
, pp. 1123-1143
-
-
Kummer, M.1
-
26
-
-
0001176794
-
The weak truth table degrees of recursively enumerable sets
-
Ladner R.E., Sasso L.P. Jr. The weak truth table degrees of recursively enumerable sets. Ann. Math. Logic. 8:1975;429-448
-
(1975)
Ann. Math. Logic
, vol.8
, pp. 429-448
-
-
Ladner, R.E.1
Sasso Jr., L.P.2
-
27
-
-
0001041068
-
The various measures of the complexity of finite objects (an axiomatic description)
-
Levin L. The various measures of the complexity of finite objects (an axiomatic description). Soviet Mathematics Doklady. 17:1976;522-526
-
(1976)
Soviet Mathematics Doklady
, vol.17
, pp. 522-526
-
-
Levin, L.1
-
29
-
-
0014616203
-
A variant of the Kolmogorov concept of complexity
-
Loveland D. A variant of the Kolmogorov concept of complexity. Information and Control. 15:1969;510-526
-
(1969)
Information and Control
, vol.15
, pp. 510-526
-
-
Loveland, D.1
-
30
-
-
18344371384
-
The definition of random sequences
-
Martin-Löf P. The definition of random sequences. Information and Control. 9:1966;602-619
-
(1966)
Information and Control
, vol.9
, pp. 602-619
-
-
Martin-Löf, P.1
-
34
-
-
4544279425
-
A formal theory of inductive inference I and II
-
224-254
-
Solomonoff R. A formal theory of inductive inference I and II. Information and Control. 7:1964;1-22. 224-254
-
(1964)
Information and Control
, vol.7
, pp. 1-22
-
-
Solomonoff, R.1
-
35
-
-
0004108928
-
-
unpublished notes, May unpublished manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, NY
-
Solovay R. Draft of a paper (or series of papers) on Chaitin's work, unpublished notes, May, 1975, unpublished manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 215 pages.
-
(1975)
Draft of a Paper (Or Series of Papers) on Chaitin's Work
, pp. 215
-
-
Solovay, R.1
-
36
-
-
84960561455
-
On computable numbers with an application to the Entscheidungs-problem
-
Turing A., On computable numbers with an application to the Entscheidungs-problem, Proceedings of the London Mathematical Society 42 (1936), 230-265
-
(1936)
Proceedings of the London Mathematical Society
, vol.42
, pp. 230-265
-
-
Turing, A.1
-
39
-
-
0011565585
-
-
Ph. D. Diss. University of Amsterdam
-
van Lambalgen M., Random Sequences, Ph. D. Diss. University of Amsterdam, 1987.
-
(1987)
Random Sequences
-
-
Van Lambalgen, M.1
-
41
-
-
18944400732
-
On languages with simple initial segments
-
University of Amsterdam
-
Zambella D., On Languages with simple initial segments, Technical Report, University of Amsterdam, 1990.
-
(1990)
Technical Report
-
-
Zambella, D.1
|