A complexity-theoretic proof of a Recursion-Theoretic Theorem

Authors:
Amir M. Ben-Amram
Affiliations:
The Academic College of Tel-Aviv Yaffo, Tel Aviv, Israel
Venue:
ACM SIGACT News
Year:
2004

Citing 2
Cited 0

Recursively enumerable sets and degrees

Recursively enumerable sets and degrees
An introduction to Kolmogorov complexity and its applications (2nd ed.)

An introduction to Kolmogorov complexity and its applications (2nd ed.)

Quantified Score

Hi-index	0.00

Visualization

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.