### What people are saying - Write a review

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

### Contents

Algorithms Turing Machines and Finite Automata | 1 |

Continuous automata or analogue computers | 18 |

The algebraic set theory of mappings and relations | 24 |

Copyright | |

32 other sections not shown

### Common terms and phrases

adaptive control adjust algorithm application artificial intelligence automaton theory Axiom behaviour binary relation calculus computable functions concept construction control system correlation Cybernetic decision problem defined denoted described determined discourse discussed domain elements embodied environment equivalence relation equivalent example experimental finite automata function given goal Group substitution hedony Hence heuristic input instruction internal key-points language learning system logical nets mapping math mathematics mechanism mentation metasystem method misinformation n-tuple normal algorithm noughts-and-crosses nth trial occur operation processes organism output parameters participant interaction particular perform polynomial possible probability problem problem-solving Proc procedure properties propositional calculus relevant represented response Riguet selection self-organizing system sequence set theory signal simplified solution solving specified stimulus strategy structured skill sub-goals subset subskill symbols tape theorem tote unit Turing machine Type I analogy variables