<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="http://www.bibsonomy.org/user/schaul/posterior,"><title>BibSonomy publications for /user/schaul/posterior,</title><link>http://www.bibsonomy.org/publrss/user/schaul/posterior,</link><description>BibSonomy RSS Feed for /user/schaul/posterior,</description><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2ad3bed5cce8f450800064b63706a6249/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f02ccc4a785f11b569dbd098e189c91e/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/22205881d024c913a7d4ea58ec9b3d196/schaul"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/2ad3bed5cce8f450800064b63706a6249/schaul"><title>Monotone Conditional Complexity Bounds on Future Prediction Errors</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/2ad3bed5cce8f450800064b63706a6249/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>solomonoff, bounds, error, prediction, deficiency, complexity, online, total kolmogorov, conditional, juergen, loss, posterior, future, randomness, sequential, monotone, prior, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;A. &lt;a href=&#034;http://www.bibsonomy.org/author/Chernov&#034;&gt;Chernov&lt;/a&gt;  und M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proc. 16th International Conf. on Algorithmic Learning Theory (ALT&#039;05), &lt;/em&gt;&lt;em&gt;Volume3734vonLNAI, &lt;/em&gt;&lt;em&gt;Seite414--428. &lt;/em&gt;&lt;em&gt;Singapore, &lt;/em&gt;&lt;em&gt;Springer, Berlin, &lt;/em&gt;(&lt;em&gt;2005&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/solomonoff,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bounds,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/error,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prediction,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/deficiency,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/complexity,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/online,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/total"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kolmogorov,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/conditional,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/loss,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/posterior,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/future,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/randomness,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sequential,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/monotone,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prior,"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2f02ccc4a785f11b569dbd098e189c91e/schaul"><title>On Generalized Computable Universal Priors and their Convergence</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/2f02ccc4a785f11b569dbd098e189c91e/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>juergen, posterior, sequence, information, solomonoffs, algorithmic, randomness, mixture, universal computability, convergence, martin-loef, distributions, probability, prior, theory, concepts, prediction, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Theoretical Computer Science&lt;/em&gt;(&lt;em&gt;2005&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/posterior,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sequence,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/solomonoffs,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithmic,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/randomness,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mixture,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/universal"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/computability,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/convergence,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/martin-loef,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/distributions,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/probability,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prior,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/theory,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/concepts,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prediction,"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/22205881d024c913a7d4ea58ec9b3d196/schaul"><title>Universal Convergence of Semimeasures on Individual Random Sequences</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/22205881d024c913a7d4ea58ec9b3d196/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>prediction, martin-lof, semimeasure, information, convergence, distributions, quasimeasures, randomness, universal algorithmic, mixture, theory, enumerable, juergen, sequence, posterior, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  und  &lt;a href=&#034;http://www.bibsonomy.org/author/An&#034;&gt;An&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proc. 15th International Conf. on Algorithmic Learning Theory (ALT&#039;04), &lt;/em&gt;&lt;em&gt;Volume3244vonLNAI, &lt;/em&gt;&lt;em&gt;Seite234--248. &lt;/em&gt;&lt;em&gt;Padova, &lt;/em&gt;&lt;em&gt;Springer, Berlin, &lt;/em&gt;(&lt;em&gt;2004&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prediction,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/martin-lof,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/semimeasure,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/convergence,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/distributions,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/quasimeasures,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/randomness,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/universal"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithmic,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mixture,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/theory,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/enumerable,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sequence,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/posterior,"/></rdf:Bag></taxo:topics></item></rdf:RDF>