Some theorems on the algorithmic approach to probability theory and information theory-Reference-Cited by-同舟云学术

Some theorems on the algorithmic approach to probability theory and information theory

Published:2010-12 Issue:3 Volume:162 Page:224-235
ISSN:0168-0072
Container-title:Annals of Pure and Applied Logic
language:en
Short-container-title:Annals of Pure and Applied Logic

Author:

Levin Leonid A.

Publisher

Elsevier BV

Subject

Logic

Reference32 articles.

1. V.N. Agafonov, Ob algoritmakh, chastote i sluchajnosti, Ph.D. thesis, Novosibirsk, 1970.

2. Ja.M. Barzdin’, Slozhnost’ i chastotnoe reshenie nekotorykh algoritmicheski nerazreshimykh massovykh problem, Preprint, 1970.

3. Slozhnost’ programm, raspoznayushchikh prinadlezhnost’ natural’nykh chisel, ne prevyshayushchikh n, rekursivno perechislimomu mnozhestvu (Complexity of programs which recognize whether natural numbers not exceeding n belong to a recursively enumerable set);Barzdin’;Dokl. Akad. Nauk SSSR,1968

4. O chastotnom reshenii algoritmicheski nerazreshimykh massovykh problem (Frequency solution of algorithmically unsolvable queueing problems);Barzdin’;Dokl. Akad. Nauk SSSR,1970

5. O vychislimosti na veroyatnostnykh mashinakh (Computability on probabilistic machines);Barzdin’;Dokl. Akad. Nauk SSSR,1969

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Gacs – Kucera theorem;Theoretical Computer Science;2022-09

2. Information Distance Revisited;LEIBNIZ INT PR INFOR;2020

3. Compression of Data Streams Down to Their Information Content;IEEE Transactions on Information Theory;2019-07

4. Putnam’s Diagonal Argument and the Impossibility of a Universal Learning Machine;Erkenntnis;2018-02-21

5. Strict process machine complexity;Archive for Mathematical Logic;2014-03-20