Search
Now showing items 11-20 of 36
Indispensability Argument and Set Theory
(University of Kent, Centre for Reasoning, 2013-09-02)
Towards Model-Based Model of Cognition
(University of Kent, Centre for Reasoning, 2013-09-02)
Is Scientific Modeling an Indirect Methodology?
(University of Kent, Centre for Reasoning, 2013-09-02)
Frege's Puzzle from Model-Based Point of View
(2013-09-02)
The Nature of Mathematics – an interview with Professor Karlis Podnieks
(Facts on File, 2013-09-02)
Frege's Puzzle from a Model-Based Point of View
(University of Kent, Centre for Reasoning, 2013-09-02)
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 ...
On the reducibility of function classes
(Latvia State University, 1972)
N – the set of all natural numbers, F – the set of all total functions N→N, A, B<=F. We say that A is m-reducible to B (A<=m B), iff there is a recursive operator M such that f in A, iff M(f) in B for all f in F. Similarly, ...