12
Views
8
CrossRef citations to date
0
Altmetric
Original Articles

Strong noncomputability of random strings

&
Pages 43-45 | Received 01 Aug 1981, Published online: 19 Mar 2007

References

  • Calude C. Chiţescu I. Random strings according to A. N. Kolmogorov and P. Martin-Löf. Classical approach Foundations of Control Engineering (to appear).
  • Kolmogorov , A. N. 1965 . Three approaches to the quantitative definition of information . Problems of Information Transmission , 1 : 1 – 7 .
  • Machtey , M. and Young , P. 1978 . An introduction to the general theory of algorithms , New-York : North-Holland .
  • Martin-Löf , P. 1966 . Algorithms and random sequences , Nürnberg, Erlagen : Erlagen University .
  • Rogers , H. Jr. 1967 . The theory of recursive junctions and effective computability , New-York : McGraw-Hill .
  • Zvonkin , A. and Levin , L. 1970 . The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms . Uspehi. Mat. Nauk , 156 : 85 – 127 . in Russian

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.