Feasible Computations and Provable Complexity Properties

Name: Feasible Computations and Provable Complexity Properties
Rating: 4 (2 reviews)

Juris Hartmanis

1978년 1월 · CBMS-NSF Regional Conference Series in Applied Mathematics 30권 · SIAM

4.0

리뷰 2개

eBook

페이지

적용 가능

검증되지 않은 평점과 리뷰입니다. 자세히 알아보기

eBook 정보

An overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations. The author begins by defining and discussing efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE. Definitions and results are uniformly extended to computationally simpler natural families of languages such as NL, P, and CSL by using Log n-tape bounded reductions. The problem of determining what can and cannot be formally proven about running times of algorithms is discussed and related to the problem of establishing sharp time bounds for one-tape Turing machine computations, and the inability to formally prove running times for algorithms is then related to the presence of gaps in the hierarchy of complexity classes. The concluding discussion is on the possibility that the famous P=NP? problem is independent of the axioms of formal mathematical systems such as set theory.