8
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Embedding recursive functions in universal algorithms

Pages 273-276 | Received 01 May 1987, Published online: 19 Mar 2007

References

  • Claude , C. and Chitescu , I. 1983 . Strong noncomputability of random strings . Intern. Journal Computer Math , 11 : 43 – 45 .
  • Kolmogorov , A.N. 1968 . “ Three approaches to the concept of the amount of information ” . In Selected Translations in Mathematical Statistics and Probability , Vol. 7 , 293 – 302 . American Math. Soc .
  • Rogers , H. Jr . 1967 . The Theory of Recursive Functions 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 . Russian Math. Surveys , 25 ( 6 ) : 83 – 124 .

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.