Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

Algorithmic models of prediction: formal properties and philosophical implications

2018/31/B/HS1/04018

Keywords:

prediction computability theory stochastic processes information theory

Descriptors:

  • HS1_4: Logic, science methodology, philosophy of science
  • ST6_4: Formal methods, foundations of computer science, including theoretical computer science, quantum algorithms
  • ST1_13: Probability and statistics

Panel:

HS1 - Fundamental questions of human existence and the nature of reality: philosophy, cognition, religious studies, theology

Host institution :

Instytut Podstaw Informatyki Polskiej Akademii Nauk

woj. mazowieckie

Other projects carried out by the institution 

Principal investigator (from the host institution):

dr Dariusz Kalociński 

Number of co-investigators in the project: 3

Call: OPUS 16 - announced on 2018-09-14

Amount awarded: 824 180 PLN

Project start date (Y-m-d): 2019-09-16

Project end date (Y-m-d): 2022-11-15

Project duration:: 38 months (the same as in the proposal)

Project status: Project settled

Project description

Download the project description in a pdf file

Note - project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.

Information in the final report

  • Publication in academic press/journals (5)
  • Articles in post-conference publications (4)
  1. A Refutation of Finite-State Language Models through Zipf's Law for Algorithmic Information
    Authors:
    Łukasz Dębowski
    Academic press:
    Entropy (rok: 2021, tom: 23, strony: 12785), Wydawca: MDPI
    Status:
    Published
    DOI:
    10.3390/e23091148 - link to the publication
  2. Universal Coding and Prediction on Ergodic Random Points
    Authors:
    Łukasz Dębowski, Tomasz Steifer
    Academic press:
    Bulletin of Symbolic Logic (rok: 2022, tom: Issue 3, Volume 28, strony: 387-412), Wydawca: Cambridge Core
    Status:
    Published
    DOI:
    10.1017/bsl.2022.18 - link to the publication
  3. Generalization of Shapiro's theorem to higher arities and noninjective notations
    Authors:
    Dariusz Kalociński, Michał Wrocławski
    Academic press:
    Archive for Mathematical Logic (rok: 2022, tom: not assigned, strony: brak danych), Wydawca: Springer
    Status:
    Published
    DOI:
    10.1007/s00153-022-00836-4 - link to the publication
  4. Universal Densities Exist for Every Finite Reference Measure
    Authors:
    Łukasz Dębowski
    Academic press:
    IEEE Transactions on Information Theory (rok: 2023, tom: 69, strony: 5277-5288), Wydawca: IEEE Information Theory Society
    Status:
    Published
    DOI:
    10.1109/TIT.2023.3261660 - link to the publication
  5. A note on the learning-theoretic characterizations of randomness and convergence
    Authors:
    Tomasz Steifer
    Academic press:
    Review of Symbolic Logic (rok: 2021, tom: -, strony: 45306), Wydawca: Cambridge University Press
    Status:
    Published
    DOI:
    10.1017/S1755020321000125 - link to the publication
  1. Degre spectra, and relative acceptability of notations
    Authors:
    Nikolay Bazhenov, Dariusz Kalociński
    Conference:
    Annual Conference on Computer Science Logic 2023 (CSL'23) (rok: 2023, ), Wydawca: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
    Data:
    konferencja 13-16.02.2023
    Status:
    Published
  2. Probabilistic vs Deterministic Gamblers
    Authors:
    Laurent Bienvenu, Valentino Delle Rose, Tomasz Steifer
    Conference:
    International Symposium on Theoretical Aspects of Computer Science (rok: 2022, ), Wydawca: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
    Data:
    konferencja 15-18 marca 2022
    Status:
    Published
  3. Simple betting and stochasticity
    Authors:
    Tomasz Steifer
    Conference:
    Computability in Europe 2021: Connecting with Computability (rok: 2021, ), Wydawca: Springer
    Data:
    konferencja 5-9 lipca 2021
    Status:
    Published
  4. Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order
    Authors:
    Nikolay Bazhenov, Dariusz Kalociński, Michał Wrocławski
    Conference:
    International Symposium on Theoretical Aspects of Computer Science (rok: 2022, ), Wydawca: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
    Data:
    konferencja 15-18 marca
    Status:
    Published

O Narodowym Centrum Nauki

Finansowanie nauki

Współpraca zagraniczna

Centrum prasowe

Deklaracja dostępności
Przetwarzanie danych osobowych
Polityka cookies

Partnerzy