Computation: Finite and Infinite Machines, Volume 2 |
Contents
PHYSICAL MACHINES | 1 |
NEURAL NETWORKS | 32 |
THE MEMORIES OF EVENTS | 67 |
Copyright | |
11 other sections not shown
Other editions - View all
Common terms and phrases
adding machine alphabet antecedent argument automata axiom behavior binary numbers canonical system cell chapter complete computable numbers construction corresponding defined described diagram digits effective procedure encoding equivalent example finite machine finite number finite set finite-state machine firing formal general-recursive given halting problem Hence induction infinite input instruction integers Kleene Kleene Algebra letters logical machine's mathematical McCulloch-Pitts memory method nets notion operation output fibers pair palindrome partial-recursive function Post canonical system precisely primitive recursion primitive-recursive function production program machine proof prove pulse q₁ quintuples reader real numbers recognize recursive definition recursive function regular expression regular set represented result rules of inference S₁ scaler set of sequences signals simple simulate square string structure Suppose symbols tag system tape theorem theory threshold tion Turing's Turing's thesis unary universal machine universal Turing machine unsolvable zero