DocumentCode
603749
Title
On the improbability of algorithmic specified complexity
Author
Ewert, W. ; Marks, Robert J. ; Dembski, W.A.
Author_Institution
Dept. of Electr. & Comput. Eng., Baylor Univ. Waco, Waco, TX, USA
fYear
2013
fDate
11-11 March 2013
Firstpage
68
Lastpage
70
Abstract
An event with low probability is unlikely to happen, but events with low probability happen all of the time. This is because many distinct low probability events can have a large combined probability. However, some low probability events can be seen to follow an independent pattern. Algorithmic specified complexity (ASC) measures the degree to which an event is improbable and follows a pattern. We show a bound on the probability of obtaining a particular value of algorithmic specified complexity. Consequently we can say that high ASC objects are improbable.
Keywords
computational complexity; probability; ASC objects; algorithmic specified complexity improbability; low probability events; Complexity theory; Computer languages; Computers; Educational institutions; Information theory; Probability distribution; Upper bound; Kolmogorov complexity; algorithmic information theory; specified complexity;
fLanguage
English
Publisher
ieee
Conference_Titel
System Theory (SSST), 2013 45th Southeastern Symposium on
Conference_Location
Waco, TX
ISSN
0094-2898
Print_ISBN
978-1-4799-0037-4
Type
conf
DOI
10.1109/SSST.2013.6524962
Filename
6524962
Link To Document