April 2012
Intermediate to advanced
416 pages
10h 40m
English
Content preview from Theory of Computation
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
INDEX
1-1 correspondence, 46
1-completeness, 217
1-degree, 219
1-reducibility, 187
1-reducibility, 183
1-way infinite tape, 342
3S AT, 372
a-successor, 261
a.e., 151
acceptance by FA, 247
accepting ID, 333
Ackermann, 110
function, 110
Ackermann function, 148
inner argument of, 149
subscript argument of, 149
Algol, 92
algorithm, 91
alphabet, 39
of URM, 93
ambiguity, 75
arithmetical relation, 229
arithmetization, 141
of a URM computation, 141
automata, 242
equivalent, 262
automaton, 242
deterministic, 244
finite, 244
deterministic, 244
nondeterministic, 258
pushdown, 295
state of, 242
axiom
logical, 19
nonlogical, 19
axiom of choice, 198
computable, 198
axiomatic system, 221
reasonable, 222
Backus-Naur Form, 277
basis
of induction, 63
basis function, 101
big-O notation, 339
f (n) = O(g(n)), 339
blank symbol, 331
BNF, 277
Boolean
operations, 109
variables, 15
Boolean variable, 277
bounded multiplication, 110
bounded primitive recursion, 356
bounded quantifiers, 29
bounded recursion
simultaneous, 361
bounded search, 110
alternative, 360
alternative symbol: (
y)<z, 360
symbol: (μy)<z, 110
bounded summation, 110
restricted, 373
CA, 227
calculable function, 91
cancelling indices, 58
canonical index, 206
cardinality argument, 162
Cartesian product, 38
Cartesian projection, 87
CFG, 281
CFL, 281
chain in a tree, 316
characteristic function, 59,
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.