Search
Now showing items 1-10 of 36
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 ...
Вокруг теоремы Геделя
(Рига: Зинатне, 1992)
Проведен методологический анализ природы математики.
Показано, что сущность математического метода состоит в исследовании
застывших моделей. Обоснована несостоятельность утверждений об
ограниченности аксиоматического ...
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 ...
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 ...
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)
Теорема Гёделя о неполноте
(Издательство МЦНМО, 2010)
Если оценивать открытия ХХ века по их влиянию на образ научного мышления,
то открытие Курта Гёделя следует (по значению) приравнять к открытию
принципов теории относительности и квантовой механики.
Towards a General Definition of Modeling
(2013-09-02)