• English
    • Latviešu
    • Deutsch
    • русский
  • Help
  • English 
    • English
    • Latviešu
    • Deutsch
    • русский
  • Login
Search 
  •   DSpace Home
  • B5 – LU institūti un aģentūras / Institutes and agencies of the UL
  • Search
  •   DSpace Home
  • B5 – LU institūti un aģentūras / Institutes and agencies of the UL
  • Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

Search

Show Advanced FiltersHide Advanced Filters

Filters

Use filters to refine the search results.

Now showing items 1-9 of 9

  • Sort Options:
  • Relevance
  • Title Asc
  • Title Desc
  • Issue Date Asc
  • Issue Date Desc
  • Results Per Page:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
Thumbnail

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 ...
Thumbnail

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 ...
Thumbnail

Prediction of the next value of a function 

Podnieks, Karlis (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 ...
Thumbnail

On speeding up synthesis and prediction of functions 

Barzdins, Janis; Kinber, Efim; Podnieks, Karlis (Latvia State University, 1974)
Thumbnail

Probabilistic program synthesis 

Podnieks, Karlis (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 ...
Thumbnail

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 ...
Thumbnail

Towards a theory of inductive inference 

Barzdins, Janis; Podnieks, Karlis (1973)
Thumbnail

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. ...
Thumbnail

Comparing various types of limiting synthesis and prediction of functions 

Podnieks, Karlis (Latvia State University, 1974)

University of Latvia
Contact Us | Send Feedback
Theme by 
@mire NV
 

 

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CommunityBy Issue DateAuthorsTitlesSubjects

My Account

Login

Discover

AuthorPodnieks, Karlis (9)Barzdins, Janis (3)Freivalds, Rusins (1)Kinber, Efim (1)Subject
inductive inference (9)
deterministic (4)function prediction (4)program synthesis (4)machine learning (3)MATHEMATICS (3)prediction (3)probabilistic (2)average (1)complexity (1)... View MoreDate Issued1990 - 1991 (1)1980 - 1989 (1)1973 - 1979 (7)

University of Latvia
Contact Us | Send Feedback
Theme by 
@mire NV