Agafonov V. N.. Složnost' vyčisléniá psévdoslučajnyh poslédovatél'nostéj. Algébra i logika, vol. 7 no. 2 , pp. 4–19.Agafonov V. N.. Complexity of computing pseudorandom sequences. English translation of the preceding. Algebra and logic , vol. 7 , pp. 72–81 [Book Review]

Journal of Symbolic Logic 40 (2):248-249 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Complexity of Computing Pseudorandom Sequences.V. N. Agafonov - 1975 - Journal of Symbolic Logic 40 (2):248-249.
Approximation Logic and Strong Bunge Algebra.Michiro Kondo - 1995 - Notre Dame Journal of Formal Logic 36 (4):595-605.
A Boolean model of ultrafilters.Thierry Coquand - 1999 - Annals of Pure and Applied Logic 99 (1-3):231-239.
On well-generated Boolean algebras.Robert Bonnet & Matatyahu Rubin - 2000 - Annals of Pure and Applied Logic 105 (1-3):1-50.
MV and Heyting Effect Algebras.D. J. Foulis - 2000 - Foundations of Physics 30 (10):1687-1706.

Analytics

Added to PP
2016-06-30

Downloads
7 (#1,195,974)

6 months
1 (#1,027,696)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references