- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences
Complexity:1-10 (2017)
Abstract
This article has no associated abstract. (fix it)Author Profiles
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Constructive equivalence relations on computable probability measures.Laurent Bienvenu & Wolfgang Merkle - 2009 - Annals of Pure and Applied Logic 160 (3):238-254.
The Meaning of the Concept of Probability in Application to Finite Sequences.Hilary Putnam - 1990 - Routledge.
Finitistic and Frequentistic Approximation of Probability Measures with or without σ-Additivity.G. Schurz & H. Leitgeb - 2008 - Studia Logica 89 (2):257-283.
Limit computable integer parts.Paola D’Aquino, Julia Knight & Karen Lange - 2011 - Archive for Mathematical Logic 50 (7-8):681-695.
Almost everywhere domination and superhighness.Stephen G. Simpson - 2007 - Mathematical Logic Quarterly 53 (4):462-482.
Recursive events in random sequences.George Davie - 2001 - Archive for Mathematical Logic 40 (8):629-638.
Finite computable dimension does not relativize.Charles F. D. McCoy - 2002 - Archive for Mathematical Logic 41 (4):309-320.
Measure, randomness and sublocales.Alex Simpson - 2012 - Annals of Pure and Applied Logic 163 (11):1642-1659.
Computable choice functions for computable linear orderings.Manuel Lerman & Richard Watnick - 2003 - Mathematical Logic Quarterly 49 (5):485-510.
General random sequences and learnable sequences.C. P. Schnorr & P. Fuchs - 1977 - Journal of Symbolic Logic 42 (3):329-340.
The Semimeasure Property of Algorithmic Probability -- “Feature‘ or “Bug‘?Douglas Campbell - 2013 - In David L. Dowe (ed.), Algorithmic Probability and Friends: Bayesian Prediction and Artificial Intelligence. Springer Berlin Heidelberg. pp. 79--90.
Analytics
Added to PP
2017-12-22
Downloads
17 (#649,212)
6 months
1 (#486,551)
2017-12-22
Downloads
17 (#649,212)
6 months
1 (#486,551)
Historical graph of downloads
Author Profiles
References found in this work
Structure emerges faster during cultural transmission in children than in adults.Vera Kempe, Nicolas Gauvrit & Douglas Forsyth - 2015 - Cognition 136:247-254.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7cdd687c8d-b6fst N