Theory of computation: how to start

Authors:
Leonid Levin
Affiliations:
Boston University, Computer Science department, 111 Cummington St, Boston, MA
Venue:
ACM SIGACT News
Year:
1991

Citing 3
Cited 0

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
A Machine-Independent Theory of the Complexity of Recursive Functions

Journal of the ACM (JACM)
Computation: finite and infinite machines

Computation: finite and infinite machines

Quantified Score

Hi-index	0.00

Visualization

Abstract