• English
    • Latviešu
    • Deutsch
    • русский
  • Help
  • Deutsch 
    • English
    • Latviešu
    • Deutsch
    • русский
  • Einloggen
Dokumentanzeige 
  •   DSpace Startseite
  • B6 – LU institūti un aģentūras / Institutes and agencies of the UL
  • Matemātikas un informātikas institūts / Institute of Mathematics and Computer Science
  • Publicēti raksti (MII) / Published Articles
  • Dokumentanzeige
  •   DSpace Startseite
  • B6 – LU institūti un aģentūras / Institutes and agencies of the UL
  • Matemātikas un informātikas institūts / Institute of Mathematics and Computer Science
  • Publicēti raksti (MII) / Published Articles
  • Dokumentanzeige
JavaScript is disabled for your browser. Some features of this site may not work without it.

Computational complexity of prediction strategies

Thumbnail
Öffnen
Podnieks_Prediction_1977.pdf (1.018Mb)
Autor
Podnieks, Karlis
Datum
1977
Metadata
Zur Langanzeige
Zusammenfassung
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 paper that such "optimal" strategies require 2^2^cm time to compute the m-th prediction (^ stands for expoentiation).
URI
https://dspace.lu.lv/dspace/handle/7/31218
Collections
  • Publicēti raksti (MII) / Published Articles [26]

University of Latvia
Kontakt | Feedback abschicken
Theme by 
@mire NV
 

 

Stöbern

Gesamter BestandBereiche & SammlungenErscheinungsdatumAutorenTitelnSchlagwortenDiese SammlungErscheinungsdatumAutorenTitelnSchlagworten

Mein Benutzerkonto

Einloggen

Statistik

Benutzungsstatistik

University of Latvia
Kontakt | Feedback abschicken
Theme by 
@mire NV