scientific article
From MaRDI portal
Publication:3046708
zbMath1050.68076MaRDI QIDQ3046708
Publication date: 12 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2375/23750216.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational learning theory (68Q32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Related Items
On universal prediction and Bayesian confirmation ⋮ Algorithmic complexity bounds on future prediction errors ⋮ Open problems in universal induction \& intelligence ⋮ A circuit complexity formulation of algorithmic information theory ⋮ Physical limits of inference ⋮ Sequential predictions based on algorithmic complexity