Computation - Algorithms
No description yet. This curated deck is ready for daily study.
Card preview (10)
What is an algorithm
Set of rules Mechanisable Eg. Adding two digit numbers Recipes, Navigation
Turing machine components
• Infinite tape • read/write head to examine and modify squares • an alphabet eg. 0, 1, blank • storage of current state • set of rules With a long enough tape anything can be computed.
How Turing machine ads numbers
Through a set of rules changes numbers representing two and three 11 and 111 to form 11111 for 5
Church Turing thesis
Any mechanically computable procedure should be computable by a machine.
What does Turing complete mean
It can simulate any Turing machine. Eg. Computers, PPT, Minecraft Redstone Can express all computable functions
CTM workings
From finite representations and rules we can generate infinitely many distinct thoughts
Properties of CTM
Productivity - combining symbols Systematicity - changing arrangement of symbols. Loves(M, J) Loves(J, M)
What is the viewpoint of strong AI
An appropriately programmed computer has cognitive States A digital computer can have understanding, consciousness etc.
Weak AI Standpoint
Computers are useful for studying cognition Simulation ≠ duplication
CTM is inbetween
Strong AI and weak AI viewpoints