Authors: Efim Kinber and Thomas Zeugmann*
Source: “Fundamentals of Computation Theory International Conference FCT '89 Szeged, Hungary, August 21-25, 1989, Proceedings,” (J. Csirik, J. Demetrovics, and F. Gécseg, Eds.), Lecture Notes in Computer Science 380, pp. 257-266, Springer-Verlag 1989.
Abstract. For EX and BC-type identification Monte-Carlo inference as well as reliable frequency identification on sets of functions are introduced. In particular, we relate the one to the other and characterize Monte-Carlo inference to exactly coincide with reliable frequency identification, on any set M. Moreover, it is shown that reliable EX and BC-frequency inference forms a new discrete hierarchy having the breakpoints 1, 1/2, 1/3, ....
*The results were obtained during the author's visit of the computing center of the Latvian State University.
©Copyright 1989, Springer-Verlag