About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Kramosil, Ivan
Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs. (English). Kybernetika, vol. 17 (1981), issue 5, pp. 359-367
MSC: 03B05, 03B35, 03D15, 68C25, 68Q05, 68Q25, 68T15 | MR 648208 | Zbl 0484.68073
References:
[1] G. J. Chaitin: Information-theoretic limitations of formal systems. J. Assoc. Comput. Mach. 21 (1974), 3, 403-424. MR 0455537 | Zbl 0287.68027
[2] T. L. Fine: Theories of Probability (An Examination of Foundations). Academic Press, New York-London 1973. MR 0433529 | Zbl 0275.60006
[3] C. P. Schnorr: Zufälligkeit und Wahrscheinlichkeit. (Lecture Notes in Math. 218). Springer-Verlag, Berlin -New York 1971. MR 0414225 | Zbl 0232.60001
[4] J. Wiedermann: Pravdepodobnostné algoritmy. (Probabilistic algorithms - in Slovak). Informačně systémy 3 (198.0), 245-257.
Partner of
EuDML logo