|
|
|
|
| LEADER |
04188nmm a2200457 u 4500 |
| 001 |
EB002120121 |
| 003 |
EBX01000000000000001258178 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
221028 ||| eng |
| 020 |
|
|
|a 9786611793135
|
| 020 |
|
|
|a 9780080867755
|
| 020 |
|
|
|a 9780444703569
|
| 020 |
|
|
|a 9781281793133
|
| 020 |
|
|
|a 1281793132
|
| 020 |
|
|
|a 044470356X
|
| 020 |
|
|
|a 0080867758
|
| 050 |
|
4 |
|a QA267
|
| 100 |
1 |
|
|a Calude, Cristian
|
| 245 |
0 |
0 |
|a Theories of computational complexity
|c Christian Calude
|
| 260 |
|
|
|a Amsterdam
|b North-Holland
|c 1988, 1988
|
| 300 |
|
|
|a xiii, 487 pages
|
| 505 |
0 |
|
|a Chapter 44. KOLMOGOROV and MARTIN-LOF's Complexity Theory; 4.1. Examples; 4.2. KOLMOGOROV's Complexity; 4.3. MARTIN-LOF Tests; 4.4. Undecidability Theorems; 4.5. Representability Theorems; 4.6. Recursive MARTIN-LOF Tests; 4.7. Infinite Oscillations; 4.8. Probabilistic Algorithms; 4.9. History; 4.10. Exercises and Problems; Chapter 5; 5. Subrecursive Programming Hierarchies; 5.1. Examples; 5.2. The LOOP Language; 5.3. LOOP Hierarchies; 5.4. A Universal Language; 5.5. A Dynamic Characterization of LOOP Classes; 5.6. Augmented LOOP Languages; 5.7. Simple Functions; 5.8. Program Size
|
| 505 |
0 |
|
|a 2.3. Equational Characterization of Partial Recursive Functions2.4. GODEL Numberings; 2.5. Recursively Enumerable Sets; 2.6. Undecidability and Independence; 2.7. Uniformity; 2.8. Operators; 2.9. Recursive Real Numbers; 2.10. History; 2.11. Exercises and Problems; Chapter 3; 3. BLUM's Complexity Theory; 3.1. Examples; 3.2. BLUM Spaces; 3.3. Recursive Dependence of Complexity Measures; 3.4. Complexity Classes; 3.5. The Speed-up Phenomenon; 3.6. The Union Theorem; 3.7. Hard Recursive Functions; 3.8. Complexity Sequences; 3.9. A Topological Analysis; 3.10. History; 3.11. Exercises and Problems
|
| 505 |
0 |
|
|a 5.9. History5.10. Exercises and Problems; Bibliography; Index of notations; Subject index; Author index
|
| 505 |
0 |
|
|a Includes bibliographical references (pages 453-468)
|
| 505 |
0 |
|
|a Front Cover; Theories of Computational Complexity; Copyright Page; Contents; Preface; Introduction; Chapter 1; 1. Primitive Recursive Hierarchies; 1.1. Examples; 1.2. Ackermann-Peter's Hierarchy; 1.3. Primitive Recursive Functions; 1.4. Primitive Recursive Invariants; 1.5. Primitive Recursive Enumerations; 1.6. Sudan's Hierarchy; 1.7. Universal Sequences of Primitive Recursive Functions; 1.8. Primitive Recursive String-functions; 1.9. History; 1.10. Exercises and Problem; Chapter 2; 2. Recursive Functions; 2.1. Examples; 2.2. Arithmetization of Computation: An Example
|
| 653 |
|
|
|a Complexité de calcul (Informatique)
|
| 653 |
|
|
|a Fundamentele informatica / gtt
|
| 653 |
|
|
|a Computational complexity / http://id.loc.gov/authorities/subjects/sh85029473
|
| 653 |
|
|
|a Computational complexity / fast / (OCoLC)fst00871991
|
| 653 |
|
|
|a MATHEMATICS / General / bisacsh
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b ZDB-1-ELC
|a Elsevier eBook collection Mathematics
|
| 490 |
0 |
|
|a Annals of discrete mathematics
|
| 500 |
|
|
|a Includes indexes. - Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002
|
| 776 |
|
|
|z 9780080867755
|
| 776 |
|
|
|z 0080867758
|
| 856 |
4 |
0 |
|u https://www.sciencedirect.com/science/bookseries/01675060/35
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 511
|
| 520 |
|
|
|a This volume presents four machine-independent theories of computational complexity, which have been chosen for their intrinsic importance and practical relevance. The book includes a wealth of results - classical, recent, and others which have not been published before. In developing the mathematics underlying the size, dynamic and structural complexity measures, various connections with mathematical logic, constructive topology, probability and programming theories are established. The facts are presented in detail. Extensive examples are provided, to help clarify notions and constructions. The lists of exercises and problems include routine exercises, interesting results, as well as some open problems
|