Purchase Solution

Turing machine

Not what you're looking for?

Ask Custom Question

Cognitive scientists believe there is an infinite potential variety of human behavior. However, they also believe that this infinite behavior is produced by a finite devise, such as the Turing machine. How can these two views be reconciled?

Purchase this Solution
Solution Summary

This solution explores and reconciles (if possible) two views held by Cognitive scientists e.g an infinite potential variety of human behavior versus infinite behavior being produced by a finite devise, such as the Turing machine.

Solution Preview

One of the reasons that the Turing machine is of interest to Cognitive Psychologists is that it is a finite devise that is capable, in principle, of generating an infinite variety of behaviors. This is possible because the finite properties of a Turing machine consist of a set ...

Purchase this Solution
Free BrainMass Quizzes
How can you tell if your loved one is suicidal?

This is a small quiz to help determine if a loved one is suicidal and what steps should be taken to help stop suicide.

Childhood Disorders (Axis 1)

This quiz is designed to test one's knowledge on childhood Principle Disorders found in the DSM-IV (1994). This is a good quiz for those who wish to pursue a career in child assessment or child development. Good luck.

Sigmund Freud

How much do you know about Sigmund Freud's theories? Find out with this quiz!

Controversies in Developmental Psychology

This quiz addresses controversies in developmental psychology.

The Psychology of Sleep

This quiz is to check your understanding of the sleep-related part of psychology.

View More Free Quizzes
Related BrainMass Solutions

  • Universal Turing Machine

    19578 Universal Turing Machine What is meant by the term "programming description" of a Universal Turing Machine and by the term "architectural description" of a Universal Turing Machine?

  • Turing machine configurations and outputs

    193075 Draw Turing machine configurations and find the output as asked in the questions below. For questions 3 to 5, remember that a Turing machine starts in state 1, reading the leftmost nonblank cell. 1.

  • Turing Machine: Sequences with equal number of 1s and 0s

    106758 Turing Machine: Sequences with equal number of 1s and 0s Give the transition list for a turing machine that will determine whether for an input sequence w over symbol set {0,1}, n0(w) = n1(w).

  • Turing machine to compute the product of positive integers

    106759 Turing machine to compute the product of positive integers Construct a turing machine to compute the product x*y of any two positive integers x and y. Assume that the inputs x and y are represented in unary and are separated by a single 0.

  • Turing Machine for even palindromes

    106757 Turing Machine for even palindromes Construct a turing machine that accepts the language {ww^R : w <- {a,b}+}, where w^R denotes w superscripted R - reverse of w.

  • Logic : Turing Machines

    In this question, we consider the Turing machine 31 with the flow graph below. ...

  • Turing machine for unary decrement

    193082 Write a Turing machine algorithm to perform a unary decrement. Write a Turing machine algorithm to perform a unary decrement.

  • Turing machine to accept the language "A^n B^n C^n"

    107765 Give the transitions for a turing machine to accept the given language. Give the transitions for a turing machine that accepts the language given below.

  • A Turing machine with doubly infinite tape is similar to an

    113144 Automata and Computability A Turing machine with doubly infinite tape is similar to an ordinary Turing machine except that its tape is infinite to the left as well as to the right.

View More Related Solutions