COGS 2160 Lecture Notes - Lecture 2: Turing Machine, Computable Function, Behaviorism
18 Feb 2018
School
Department
Course
Professor
Document Summary
An early inspiration for cognitive science: the computer. Some important terms: a function is a mapping that yields exactly one output (value) for every input (argument, e. g. addition is a function. It takes numbers as arguments and yields their sum as values: e. g. the mother of x is a function. If arguments are 2 and 3, to figure out the value, you count the total pebbles: another algorithm is to do summing using aerobic notation. A turing machine: this helps pave the way for modern computers, a little backstory, during wwii turing helped crack the enigma code used by germans to communicate with their. Example: adding 1: create a turing machine that adds 1 to any number. Cogs 2160: this says that if you"re in state 1 and you see a stroke, leave it as a stroke, move to the right, and stay in state 1.
