Geodesic

Sommaire

Cybernetics and the dialectics of modern scientific knowledge
p. 3-8
Some generalizations of a~fixed-point theorem
p. 9-16
The problem of lower bounds of complexity and the theory of NP-completeness (survey)
p. 17-25
Possibilities of various models of one-sided probabilistic automata
p. 26-34
An extension of generalized Hankel matrices
p. 35-39
On T-degrees of differences of recursively enumerable sets
p. 40-49
Relations between complete sets
p. 50-55
Circuits composed of functional elements without zero paths in the basis {∨,−}
p. 56-63
On the complexity of the circuit realization of almost all monotone Boolean functions
p. 64-70
Prediction of the next value of a~function
p. 71-77
On a~system of generators for algebras over random variables
p. 78-82
Probabilistic supercounter machines
Probabilistic reset machines
p. 84-85