Browsing by Author "Podnieks, Karlis"
Now showing items 1-20 of 36
-
Comparing various concepts of function prediction. Part 1.
Podnieks, Karlis (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 concepts of function prediction. Part 2.
Podnieks, Karlis (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 types of limiting synthesis and prediction of functions
Podnieks, Karlis (Latvia State University, 1974) -
Computational complexity of prediction strategies
Podnieks, Karlis (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 ... -
The double-incompleteness theorem
Podnieks, Karlis (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 ... -
The double-incompleteness theorem
Podnieks, Karlis (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 ... -
Explanation and Understanding in a Model-Based Model of Cognition
Podnieks, Karlis (2017-11-20)This article is an experiment. Consider a minimalist model of cognition (models, means of model-building and history of their evolution). In this model, explanation could be defined as a means allowing to advance: production ... -
Frege's Puzzle from a Model-Based Point of View
Podnieks, Karlis (University of Kent, Centre for Reasoning, 2013-09-02) -
Frege's Puzzle from Model-Based Point of View
Podnieks, Karlis (2013-09-02) -
Indispensability Argument and Set Theory
Podnieks, Karlis (University of Kent, Centre for Reasoning, 2013-09-02) -
Inductive inference of recursive functions: complexity bounds
Freivalds, Rusins; Barzdins, Janis; Podnieks, Karlis (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. ... -
Introduction to Mathematical Logic (Edition 2014)
Detlovs, Vilnis; Podnieks, Karlis (2014-08-25)Hyper-textbook for students. This is Edition 2014. ATTENTION! New Edition 2021 available at https://dspace.lu.lv/dspace/handle/7/53914 -
Introduction to Mathematical Logic (Edition 2017)
Podnieks, Karlis (2017-05-24)This is Edition 2017. Read the NEW Edition 2021 at https://dspace.lu.lv/dspace/handle/7/53914. Hyper-textbook for students in mathematical logic. First order languages. Axioms of constructive and classical logic. Proving ... -
Introduction to Mathematical Logic, Edition 2021
Detlovs, Vilnis; Podnieks, Karlis (2021-02-07)Textbook for students in mathematical logic. First order languages. Axioms of constructive and classical logic. Proving formulas in propositional and predicate logic. Glivenko's theorem and constructive embedding. Axiom ... -
Is Scientific Modeling an Indirect Methodology?
Podnieks, Karlis (University of Kent, Centre for Reasoning, 2013-09-02) -
MDA: correctness of model transformations. Which models are schemas?
Podnieks, Karlis (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 ... -
Methodological consequences of Gödel's incompleteness theorem
Podnieks, Karlis (1992-03) -
On computation in the limit by non-deterministic Turing machines
Freivalds, Rusins; Podnieks, Karlis (Latvia State University, 1974) -
On computation in the limit by non-deterministic Turing machines
Freivalds, Rūsiņš; Podnieks, Karlis (Scientific Proceedings of Latvia State University, 1974) -
On speeding up synthesis and prediction of functions
Barzdins, Janis; Kinber, Efim; Podnieks, Karlis (Latvia State University, 1974)