Index
A
Acceptable proof
and axiomatic theory, 118
and effective calculability, 11
Acceptance procedure
and feasible computability, 145
recursively enumerable relations, 81–82
and semidecidability, 9
ADD, register machines, 23
Addition
binary arithmetic, 76–77
definability in arithmetic, 111
primitive recursive function, 30–32
P-time computability, 144
register machines, 24, 54
Alphabet
decadic notation definitions, 159
loop and while programs, 21
program definition, 61
register machines, 23
register machines over words, 72–73
Turing machines, 14–15
Alphabetic order, decadic notation, 159–160
Alphabet of symbols, Turing machines,
13–14
Antisymmetric relations, preordering
relations, 131
Append, letters to words, 73–74
Arithmetical hierarchy
chains, 106
and definability, 103–110 ...