Theories of Computational Complexity

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Cristian Calude (Eds.)
Series: Annals of discrete mathematics 35
Edition: 1s
Publisher: North-Holland
Year: 1988

Language: English
Pages: ii-ix, 1-487
City: Amsterdam; New York :, New York, N.Y., U.S.A

Content:
Advisory Editors
Page ii

Edited by
Page iii

Copyright page
Page iv

Dedication
Page v

Preface
Pages vii-ix
Cristian Calude

Introduction
Pages 1-2

Chapter 1 Primitive Recursive Hierarchies
Pages 3-85

Chapter 2 Recursive Functions
Pages 87-206

Chapter 3 Blum's Complexity Theory
Pages 207-296

Chapter 4 Kolmogorov and Martin-Lof's Complexity Theory
Pages 297-381

Chapter 5 Subrecursive Programming Hierarchies
Pages 383-451

Bibliography
Pages 453-468

Index of Notations
Pages 469-474

Subject Index
Pages 475-480

Author Index
Pages 481-487