#### Filter Results:

#### Publication Year

2010

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

K.Iwama and R.Freivalds [11] considered query algorithms where the black box contains a permutation. Since then several authors have compared quantum and deterministic query algorithms for permutations. It turns out that the case of n-permutations where n is an odd number is difficult. There was no example of permutation problem where quantization can save… (More)

Prediction of functions is one of processes considered in in-ductive inference. There is a " black box " with a given total function f in it. The result of the inductive inference machine F (< f (0), f (1), · · · , f (n) >) is expected to be f (n + 1). Deterministic and probabilistic prediction of functions has been widely studied. Frequency computation is… (More)

- Rihards Krišlauks, Ieva Rukš, Kaspars Balodis, Ilja Kucevalovs
- 2012

String theory in physics and molecular biology use p-adic numbers as a tool to describe properties of microworld in a more adequate way. We consider a notion of automata and Turing machines using p-adic numbers to describe random branching of the process of computation. We prove that Turing machines of this type can have advantages in reversal complexity… (More)

Identification in the limit, originally due to Gold [10], is a widely used computation model for inductive inference and human language acquisition. We consider a nonconstructive extension to Gold's model. Our current topic is the problem of applying the notions of reliability and refutability to nonconstructive identification. Four general identification… (More)

- ‹
- 1
- ›