Class Notes (838,449)
Canada (510,888)
COGS 100 (67)
Lecture

Turing Machine.docx

1 Page
127 Views
Unlock Document

Department
Cognitive Science
Course
COGS 100
Professor
Michael Picard
Semester
Fall

Description
Midterm 10-12 questions Turing Machine Chapter 1 & all course notes Main questions & lots of detailing Turing machine Calculable machine Gives result to a given input Functions -> Computable -> Turing Computable Qi (instruction), Si (seeing) , A(what to do), Q(which state to go into) Long tape of set instructions. Turing’s results: There exists universal Turing Machines There are incomputable functions. Ex: g (x)=fx (x)+1 Concept of computability – Turing computable “Everything computable is also Turing computable.” Familiar with the workings of Turing machines If the function is not defined then the machine won’t stop. In Turing’s time, a Universal Turing machine was simply a list of quadruples. Today it’s a laptop for example. Relationship between Church’s theories. Mind is a
More Less

Related notes for COGS 100

Log In


OR

Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Sign up

Join to view


OR

By registering, I agree to the Terms and Privacy Policies
Already have an account?
Just a few more details

So we can recommend you notes for your school.

Reset Password

Please enter below the email address you registered with and we will send you a link to reset your password.

Add your courses

Get notes from the top students in your class.


Submit