Back to Results
First PageMeta Content
Information theory / Randomness / Computability theory / Descriptive complexity / Kolmogorov complexity / Specified complexity / Complexity / Algorithmic information theory / PP / Theoretical computer science / Science / Applied mathematics


45th Southeastern Symposium on System Theory Baylor University, Waco, TX, USA, March 11, 2013 On the Improbability of Algorithmic Specified Complexity Winston Ewert & Robert J. Marks II
Add to Reading List

Document Date: 2013-06-10 20:34:50

Open Document

File Size: 163,92 KB

Share Result on Facebook

City

Hoboken / New York / Tulsa / /

Company

Zator Co. / Cambridge University Press / Kraft / Air Force / /

Country

United States / /

Currency

USD / /

Facility

Texas Discovery Institute / System Theory Baylor University / /

Organization

Cambridge University / Air Force office of Scientific Research / Baylor University / Texas Discovery Institute Seattle / /

Person

Winston Ewert / William A. Dembski / Joy A Thomas / Gregory J. Chaitin / Robert J. Marks II / /

ProgrammingLanguage

C / /

ProvinceOrState

New Jersey / New York / Massachusetts / /

PublishedMedium

Journal of the ACM / /

Technology

operating system / /

SocialTag