## Computation: Finite and Infinite Machines |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

PHYSICAL MACHINES | 1 |

NEURAL NETWORKS | 32 |

THE MEMORIES OF EVENTS | 67 |

Copyright | |

13 other sections not shown

### Common terms and phrases

alphabet antecedent argument automata axiom behavior binary numbers canonical system cell chapter complete computable number consider construction corresponding defined described diagram digits effective procedure encoding equivalent example fact finite machine finite number finite set finite-state machine firing formal 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 palindromes partial-recursive function possible Post canonical system precisely primitive recursion primitive-recursive function productions program machine proof prove pulse quintuples reader real numbers recognize recursive definition recursive function regular expression regular set represented result rules of inference scaler set of sequences signals simple simulate single square started structure Suppose tag system theorem theory threshold tion total-recursive function Turing's Turing's thesis unary unary notation universal machine universal Turing machine unsolvable zero