Geodesic

Probabilistic methods and cybernetics. IV

Sommaire

Testing of statistical hypotheses on the type of distribution by small samples
p. 3-23
Automaton conversion of probability sequences
p. 24-33
The class of mappings of $P_2^n$ into itself which are realizable by formulas
p. 34-44
On simulation of training schemes related to the process of creativity
p. 45-48
Estimation of the complexity of formulas for monotone functions of the algebra of logic in the class of disjunctive normal forms (d.n.f.)
p. 49-57
A new approach to decode of Reed–Müller codes
p. 58-66
A certain sufficient condition for the existence and uniqueness of a solution of the basic functional equation of dynamic programming
p. 67-68
Numerical method of dynamic programming of a problem of optimal reservation
p. 69-71
Some statements of a problem of rational cutting of industrial materials
p. 72-73
Some statistics on the syllables of Tatar language
p. 74-78
A trick of reduction of dispersion in the Monte Carlo method
p. 79-81
The Monte Carlo method for a boundary-value problem of elliptic type
p. 82-84
Cubature formulas based on the ergodic theorem
p. 85-89
The triangle inequalities for random metric spaces
p. 90-93
Generalization of some theorems of probability theory to the case of complex distributions
p. 94-100
Representation of the solution of a certain class of nonlinear operator equations
p. 101-105
Explicit extrapolation formulas for some probability processes
p. 106-109
Two corrections to the article: “Certain equivalences in the theory of probabilistic automata”