| Title:
|
Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs (English) |
| Author:
|
Kramosil, Ivan |
| Language:
|
English |
| Journal:
|
Kybernetika |
| ISSN:
|
0023-5954 |
| Volume:
|
17 |
| Issue:
|
5 |
| Year:
|
1981 |
| Pages:
|
359-367 |
| . |
| Category:
|
math |
| . |
| MSC:
|
03B05 |
| MSC:
|
03B35 |
| MSC:
|
03D15 |
| MSC:
|
68C25 |
| MSC:
|
68Q05 |
| MSC:
|
68Q25 |
| MSC:
|
68T15 |
| idZBL:
|
Zbl 0484.68073 |
| idMR:
|
MR648208 |
| . |
| Date available:
|
2009-09-24T17:23:01Z |
| Last updated:
|
2012-06-05 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/125508 |
| . |
| Reference:
|
[1] G. J. Chaitin: Information-theoretic limitations of formal systems.J. Assoc. Comput. Mach. 21 (1974), 3, 403-424. Zbl 0287.68027, MR 0455537 |
| Reference:
|
[2] T. L. Fine: Theories of Probability (An Examination of Foundations).Academic Press, New York-London 1973. Zbl 0275.60006, MR 0433529 |
| Reference:
|
[3] C. P. Schnorr: Zufälligkeit und Wahrscheinlichkeit.(Lecture Notes in Math. 218). Springer-Verlag, Berlin -New York 1971. Zbl 0232.60001, MR 0414225 |
| Reference:
|
[4] J. Wiedermann: Pravdepodobnostné algoritmy.(Probabilistic algorithms - in Slovak). Informačně systémy 3 (198.0), 245-257. |
| . |
