DeepAI AI Chat
Log In Sign Up

Kolmogorov complexity in the USSR (1975–1982): isolation and its end

07/11/2019
by   V. V. V'yugin, et al.
0

These reminiscences are about the "dark ages" of algorithmic information theory in the USSR. After a great interest in this topic in 1960s and the beginning of 1970s the number of people working in this area in the USSR decreased significantly. At that time L.A. Levin published a bunch of papers that were seminal for the modern algorithmic information theory. Then he left the USSR, and the new wave of interest was triggered by the talk of A.N. Kolmogorov at a Moscow State (Lomonosov) University Mathematical Department (Logic and Algorithms Division) seminar organized by him; several younger researchers obtained some new results in algorithmic information theory.

READ FULL TEXT

page 7

page 20

07/25/2017

Aspects of Chaitin's Omega

The halting probability of a Turing machine,also known as Chaitin's Omeg...
05/24/2023

Metamathematics of Algorithmic Composition

This essay recounts my personal journey towards a deeper understanding o...
07/12/2002

The Rise and Fall of the Church-Turing Thesis

The essay consists of three parts. In the first part, it is explained ho...
07/06/2022

100 prisoners and a lightbulb – looking back

100 prisoners and a light bulb is a long standing mathematical puzzle. T...
02/26/2021

Algorithmic Correspondence for Hybrid Logic with Binder

In the present paper, we develop the algorithmic correspondence theory f...
03/24/2020

A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions

Established and novel techniques in the field of applications of algorit...
03/24/2020

A Review of Methods for Estimating Algorithmic Complexity and Beyond: Options, and Challenges

I review previous and novel techniques in the field of applications of a...