11 Matching Annotations
  1. Dec 2023
  2. Oct 2022
    1. You are all computer scientists. You know what FINITE AUTOMATA can do. You know what TURING MACHINES can do. For example, Finite Automata can add but not multiply. Turing Machines can compute any computable function. Turing machines are incredibly more powerful than Finite Automata. Yet the only difference between a FA and a TM is that the TM, unlike the FA, has paper and pencil. Think about it. It tells you something about the power of writing. Without writing, you are reduced to a finite automaton. With writing you have the extraordinary power of a Turing machine.
  3. Aug 2022
    1. Descartesalso arrived, quite early in his investigations, at the conclusion that the studyof mind faces us with a problem of quality of complexity, not merely degreeof complexity. He felt that he had demonstrated that understanding and will,the two fundamental properties of the human mind, involved capacities andprinciples that are not realizable by even the most complex of automata.

    Tags

    Annotators

  4. Jun 2020
  5. Oct 2019