Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs
Kybernetika, Tome 17 (1981) no. 5, pp. 359-367
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
@article{KYB_1981_17_5_a1,
author = {Kramosil, Ivan},
title = {Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs},
journal = {Kybernetika},
pages = {359--367},
year = {1981},
volume = {17},
number = {5},
mrnumber = {648208},
zbl = {0484.68073},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1981_17_5_a1/}
}
TY - JOUR AU - Kramosil, Ivan TI - Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs JO - Kybernetika PY - 1981 SP - 359 EP - 367 VL - 17 IS - 5 UR - http://geodesic.mathdoc.fr/item/KYB_1981_17_5_a1/ LA - en ID - KYB_1981_17_5_a1 ER -
Kramosil, Ivan. Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs. Kybernetika, Tome 17 (1981) no. 5, pp. 359-367. http://geodesic.mathdoc.fr/item/KYB_1981_17_5_a1/
[1] G. J. Chaitin: Information-theoretic limitations of formal systems. J. Assoc. Comput. Mach. 21 (1974), 3, 403-424. | MR | Zbl
[2] T. L. Fine: Theories of Probability (An Examination of Foundations). Academic Press, New York-London 1973. | MR | Zbl
[3] C. P. Schnorr: Zufälligkeit und Wahrscheinlichkeit. (Lecture Notes in Math. 218). Springer-Verlag, Berlin -New York 1971. | MR | Zbl
[4] J. Wiedermann: Pravdepodobnostné algoritmy. (Probabilistic algorithms - in Slovak). Informačně systémy 3 (198.0), 245-257.