Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,101,965 papers from all fields of science
Search
Sign In
Create Free Account
Algorithmic probability
In algorithmic information theory, algorithmic (Solomonoff) probability is a mathematical method of assigning a prior probability to a given…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
Broader (2)
Algorithmic information theory
Artificial intelligence
Glossary of artificial intelligence
Inductive probability
Inductive reasoning
Information theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A Probabilistic Approach in Failure Modelling of Aluminium High Pressure Die-Castings
O. Knoll
2015
Corpus ID: 114844061
Aluminium high pressure die-castings have become essential elements of a modern car body in recent years. The high pressure die…
Expand
2015
2015
Neglect Of Parameter Estimation Uncertainty Can Significantly Overestimate Structural Reliability
Á. Rózsás
,
M. Sýkora
2015
Corpus ID: 67840875
Abstract Parameter estimation uncertainty is often neglected in reliability studies, i.e. point estimates of distribution…
Expand
2014
2014
Methodologies of Internet portals users' short messages texts authorship identification based on the methods of mathematical linguistics
Sukhoparov Milhail
,
Lebedev Ilya
Advanced Industrial Conference on…
2014
Corpus ID: 5813511
The article deals with the peculiarities of Internet portals, blogs and websites short messages texts authorship determination…
Expand
2013
2013
Statistics: Descriptive Statistics & Probability
G. Tsiotas
2013
Corpus ID: 154613094
2012
2012
Incompleteness and limit of security theory of quantum key distribution
O. Hirota
,
Dan Murakami
,
Kentaro Kato
,
F. Futami
Other Conferences
2012
Corpus ID: 120922334
It is claimed in the many papers that a trace distance: d guarantees the universal composition security in quantum key…
Expand
2012
2012
CONSISTENCY IMPLIES THAT PLAUSIBILITY HAS A MASS FUNCTION
Peter A. Streufert
2012
Corpus ID: 55663175
We formulate and prove a new fundamental theorem about Kreps-Wilson consistency. First, we derive from an arbitrary assessment…
Expand
2009
2009
On the computational power of random strings
A. Day
Annals of Pure and Applied Logic
2009
Corpus ID: 10903852
2008
2008
Probabilistic expert systems for the Identification of the Victims of a Mass Disaster
D. Cavallini
,
Fabio Corradi
2008
Corpus ID: 15130909
In this paper the focus is on the coherent use of nuclear DNA traits to identify the victims of a mass disaster. We demonstrate…
Expand
2007
2007
APPLICATIONS AND APPROXIMATIONS OF HETEROGENEOUS WEIGHTED AND UNWEIGHTED J-BINOMIAL PROBABILITY DISTRIBUTIONS
J. Benneyan
,
B. Harris
,
Aysun Taşeli
2007
Corpus ID: 53476444
We illustrate several applications of probability distributions for N weighted Bernoulli trials sampled from J heterogeneous…
Expand
1991
1991
REFINED BOUNDS ON SIGNATURE ANALYSIS ALIASING FOR RANDOM TESTING
N. Saxena
,
P. Franco
,
E. McCluskey
, Proceedings. International Test Conference
1991
Corpus ID: 26594533
in previous work a simple bound, ~+2 , on the aliasing probability in serial signature analysis for a random test pattern of…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE