Behaviors that Turing completeness either does not guarantee or that Turing machines cannot express:
| Jump to: | A C D E G L N P R T V |
|---|
| Index Entry | Section | ||
|---|---|---|---|
| | |||
| A | |||
| ablation: | 1.3 | ||
| ablation: | 1.6 | ||
| | |||
| C | |||
| continuous: | 1.6 | ||
| | |||
| D | |||
| discrete: | 1.4 | ||
| discrete: | 1.6 | ||
| | |||
| E | |||
| edge: | Prologue | ||
| edge: | 1.6 | ||
| | |||
| G | |||
| gas expansion: | 1.3 | ||
| graph: | Prologue | ||
| graph: | 1.6 | ||
| graph-like: | 1.1 | ||
| graph-like: | 1.6 | ||
| growth: | 1.3 | ||
| growth: | 1.6 | ||
| | |||
| L | |||
| loop: | 1.2 | ||
| loop: | 1.6 | ||
| | |||
| N | |||
| n-toroid: | 1.1 | ||
| n-toroid: | 1.6 | ||
| n-torus: | 1.1 | ||
| | |||
| P | |||
| path: | 1.6 | ||
| path redundancy: | 1.5 | ||
| path redundancy: | 1.6 | ||
| | |||
| R | |||
| redundancy: | 1.5 | ||
| | |||
| T | |||
| toroid: | 1.1 | ||
| toroid: | 1.6 | ||
| torus: | 1.1 | ||
| torus: | 1.6 | ||
| tree: | 1.2 | ||
| tree: | 1.4 | ||
| tree: | 1.6 | ||
| tree-like: | 1.2 | ||
| tree-like: | 1.6 | ||
| | |||
| V | |||
| vertex: | Prologue | ||
| vertex: | 1.6 | ||
| | |||
| Jump to: | A C D E G L N P R T V |
|---|