Aspects of Kolmogorov Complexity: The Physics of Information  

Abstract Category: Science
Course / Degree: Doctor of Philosophy in Physics
Institution / University: Northwestern International University, Denmark
Published in: 2003

Dissertation Abstract / Summary:

The dissertation will address a compressible value to a random binary sequential string in algorithmic complexity using new algorithms that are the most accuate metric for measuring algorithmic randomness in a random binary sequentail string.  A history of algorithmic complexity and copies of the author's papers given at conferences are included in the appendix section of this monograph. 

Dissertation Keywords/Search Tags:
Algorithmic Complexity, Martin-Lof Randomness, Random and Non-Random Sequential Strings

This Dissertation Abstract may be cited as follows:
Tice, B.S. (2009) Aspects of Kolmogorov Complexity: The Physics of Information.  Gottingen: Cuvillier Verlag.

Submission Details: Dissertation Abstract submitted by Bradley S. Tice from United States on 30-Mar-2011 21:15.
Abstract has been viewed 2449 times (since 7 Mar 2010).

Bradley S. Tice Contact Details: Email: paulatice@att.net

Great care has been taken to ensure that this information is correct, however ThesisAbstracts.com cannot accept responsibility for the contents of this Dissertation abstract titled "Aspects of Kolmogorov Complexity: The Physics of Information". This abstract has been submitted by Bradley S. Tice on 30-Mar-2011 21:15. You may report a problem using the contact form.
© Copyright 2003 - 2024 of ThesisAbstracts.com and respective owners.

Copyright © Thesis Abstract | Dissertation Abstracts Thesis Library 2003-2024.
by scope.com.mt @ website design