## Search

Now showing items 1-10 of 16

#### Comparing various concepts of function prediction. Part 2.

(Latvia State University, 1975)

Prediction: f(m+1) is guessed from given f(0), ..., f(m). Program synthesis: a program computing f is guessed from given f(0), ..., f(m). The hypotheses are required to be correct for all sufficiently large m, or with some ...

#### Comparing various concepts of function prediction. Part 1.

(Latvia State University, 1974)

Prediction: f(m+1) is guessed from given f(0), ..., f(m). Program synthesis: a program computing f is guessed from given f(0), ..., f(m). The hypotheses are required to be correct for all sufficiently large m, or with some ...

#### Inductive inference of recursive functions: complexity bounds

(Springer Verlag, 1991)

This survey includes principal results on complexity
of inductive inference for recursively enumerable classes of total
recursive functions. Inductive inference is a process to find an
algorithm from sample computations. ...

#### Prediction of the next value of a function

(1981)

The following model of inductive inference is considered. Arbitrary set tau = {tau_1, tau_2, ..., tau_n} of n total functions N->N is fixed. A "black box" outputs the values f(0), f(1), ..., f(m), ... of some function f ...

#### MDA: correctness of model transformations. Which models are schemas?

(IOS Press, 2005)

How to determine, is a proposed model transformation correct, or not? In general, the answer may depend on the model semantics. Of course, a model transformation is “correct”, if we can extend it to a “correct” instance ...

#### Platonism, intuition and the nature of mathematics

(Bulgarian Academy of Sciences, Sofia, 1988)

Platonism is an essential aspect of mathematical method. Mathematicians are learned ability " t o l i v e " in the "world" of mathematical concepts. Here we have the main source of the creative power of mathematics, and ...

#### Comparing various types of limiting synthesis and prediction of functions

(Latvia State University, 1974)

#### On computation in the limit by non-deterministic Turing machines

(Latvia State University, 1974)

#### On speeding up synthesis and prediction of functions

(Latvia State University, 1974)

#### Probabilistic program synthesis

(Latvia State University, 1977)

The following model of inductive inference is considered. Arbitrary numbering tau = {tau_0, tau_1, tau_2, ... } of total functions N->N is fixed. A "black box" outputs the values f(0), f(1), ..., f(m), ... of some function ...