Author of the publication

Taming randomness and complexity - Essays in honour of Professor Péter Gács.

, , and . Theor. Comput. Sci., (March 2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Dimension 1 sequences are close to randoms., , , and . CoRR, (2017)Algorithmic statistics: forty years later., and . CoRR, (2016)Non-reducible Descriptions for Conditional Kolmogorov Complexity., , , and . TAMC, volume 3959 of Lecture Notes in Computer Science, page 308-317. Springer, (2006)Prequential Randomness., and . ALT, volume 5254 of Lecture Notes in Computer Science, page 154-168. Springer, (2008)Topological arguments for Kolmogorov complexity, and . AUTOMATA & JAC, volume 90 of EPTCS, page 127-132. (2012)On the Structure of Ammann A2 Tilings., , and . Discret. Comput. Geom., 63 (3): 577-606 (2020)Combinatorial proof of Muchnik's theorem.. Kolmogorov Complexity and Applications, volume 06051 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2006)Decomposition Complexity.. JAC, page 203-213. Turku Center for Computer Science, (2010)Compressibility and Probabilistic Proofs.. CiE, volume 10307 of Lecture Notes in Computer Science, page 101-111. Springer, (2017)Non-reducible descriptions for conditional Kolmogorov complexity., , , , and . Theor. Comput. Sci., 384 (1): 77-86 (2007)