Now showing items 21-40 of 299

(1972)

(1973)
• #### Arheoloģija un etnogrāfija, 10 ﻿

(Izdevniecība "Zinātne", 1973)
• #### 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 ...
• #### 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)
• #### On computation in the limit by non-deterministic Turing machines ﻿

(Scientific Proceedings of Latvia State University, 1974)
• #### Arheoloģija un etnogrāfija, 11 ﻿

(Izdevniecība "Zinātne", 1974)
• #### 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 ...

(1975)
• #### The double-incompleteness theorem ﻿

(Latvia State University, 1975)
Let T be a theory, Q - a metatheory of T. Under certain conditions there exist T-undecidable sentences for which this undecidability cannot be proved in Q. For English translation and proof, see K. Podnieks What is ...

(1975)

(1976)
• #### The double-incompleteness theorem ﻿

(Stiinca, Kishinev, 1976)
Let T be a strong enough theory, and M - its metatheory, both are consistent. Then there is a closed arithmetical formula H that is undecidable in T, but one cannot prove in M neither that H is T-unprovable, nor that H is ...

(1977)
• #### 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 ...
• #### Computational complexity of prediction strategies ﻿

(Latvia State University, 1977)
The value f(m+1) is predicted from given f(1), ..., f(m). For every enumeration T(n, x) there is a strategy that predicts the n-th function of T making no more than log2(n) errors (Barzdins-Freivalds). It is proved in the ...

(1978)
• #### Arheoloģija un etnogrāfija, 12 ﻿

(Izdevniecība "Zinātne", 1978)