On The Computational Complexity Of Algorithms

(1965)

Abstract:

In his celebrated paper [1], A. M. Turing investigated the computability of sequences (functions) by mechanical procedures and showed that the set of sequences can be partitioned into computable and noncomputable sequences. One finds, however, that some computable sequences are very easy to compute whereas other computable sequences seem to have an inherent complexity that makes them difficult to compute. In this paper, we investigate a scheme of classifying sequences according to how hard they are to compute. This scheme puts a rich structure on the computable sequences and a variety of theorems are established. Furthermore, this scheme can be generalized to classify numbers, functions, or recognition problems according to their computational complexity.

Authors:

J. Hartmanis, and R. E. Stearns

Tags:

computer science, theory, complexity, computability

Length:

22

Submitted By:

alixander

Date Submitted:

Jul 14, 2014

Favorited:

2

Times Read:

1

Discussion and Questions