Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Methods and Applications of Algorithmic ComplexityEnumerating and Simulating Turing Machines

Methods and Applications of Algorithmic Complexity: Enumerating and Simulating Turing Machines [Our method alternative to popular lossless compression algorithms such as LZW consists in mining the space of all possible computer programs (from shorter to longer) to produce an empirical estimation of the so-called universal distribution [1, 2] related to algorithmic probability [1, 3]. To this end, we have chosen the most standard and studied model of computation, that of Turing machines [4] as used in the ‘Busy Beaver game’ [5].] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Methods and Applications of Algorithmic ComplexityEnumerating and Simulating Turing Machines

Download PDF
21 pages

Loading next page...
 
/lp/springer-journals/methods-and-applications-of-algorithmic-complexity-enumerating-and-NFf8q9kLqe
Publisher
Springer Berlin Heidelberg
Copyright
© Springer-Verlag GmbH Germany, part of Springer Nature 2022
ISBN
978-3-662-64983-1
Pages
17 –38
DOI
10.1007/978-3-662-64985-5_2
Publisher site
See Chapter on Publisher Site

Abstract

[Our method alternative to popular lossless compression algorithms such as LZW consists in mining the space of all possible computer programs (from shorter to longer) to produce an empirical estimation of the so-called universal distribution [1, 2] related to algorithmic probability [1, 3]. To this end, we have chosen the most standard and studied model of computation, that of Turing machines [4] as used in the ‘Busy Beaver game’ [5].]

Published: May 17, 2022

There are no references for this article.