Skip Navigation

The Computer Journal 1999 42(4):256-259; doi:10.1093/comjnl/42.4.256
© 1999 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Solomonoff, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Two Kinds of Probabilistic Induction

Ray SolomonoffA1

A1 Oxbridge Research, POB 391887, Cambridge, MA 02139, USA Email: rjs@world.std.com

Problems in probabilistic induction are of two general kinds. In the first, we have a linearly ordered sequence of symbols that must be extrapolated. In the second we want to extrapolate an unordered set of finite strings. A very general formal solution to the first kind of problem is well known and much work has been done in obtaining good approximations to it [1, 3, 4, 5, 6, 9, 10]. Though the second kind of problem is of much practical importance, no general solution has been published. We present two general solutions for unordered data. We also show how machines can be constructed to summarize sequential and unordered data in optimum ways.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.