e/Speed prior

New Query

Information
has glosseng: Jürgen Schmidhuber's speed prior is a complexity measure similar to Kolmogorov complexity, except that it is based on computation speed as well as program length. The speed prior complexity of a program is its size in bits plus the logarithm of the maximum time we are willing to run it to get a prediction.
lexicalizationeng: speed prior
instance ofe/Bayesian inference

Query

Word: (case sensitive)
Language: (ISO 639-3 code, e.g. "eng" for English)


Lexvo © 2008-2025 Gerard de Melo.   Contact   Legal Information / Imprint