Nothing Special   »   [go: up one dir, main page]

skip to main content
article

A complexity-theoretic proof of a Recursion-Theoretic Theorem

Published: 01 June 2004 Publication History

Abstract

It is well known that Complexity Theory inherited many tools from Recursion Theory. This note is an example where tools from Complexity Theory simplify the proof of a Recursion Theoretical result, illustrating the value of mingling the two subjects.

References

[1]
Jones, Neil D. (1997) Computability and Complexity. MIT Press, Cambridge, Mass., 1997.
[2]
Li, Ming and Vitányi, Paul (1997) An Introduction to Kolmogorov Complexity and Its Applications. 2nd ed., Springer-Verlag, New York, 1997.
[3]
Soare, Robert I. (1987) Recursively Enumerable Sets and Degrees. Springer-Verlag, Berlin 1987.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGACT News
ACM SIGACT News  Volume 35, Issue 2
June 2004
82 pages
ISSN:0163-5700
DOI:10.1145/992287
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 2004
Published in SIGACT Volume 35, Issue 2

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 193
    Total Downloads
  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Nov 2024

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media