COMP 1005 Lecture Notes - Lecture 1: Universal Turing Machine, Enigma Machine, Joseph Marie Jacquard
10 Feb 2016
School
Department
Course
Professor
Document Summary
An algorithm: is a finite, ordered set of unambiguous instructions that defines a process that will eventually terminate. Creating the representation of an algorithm that can be executed by a computer is known as programming. A computer is an electronic device for storing and processing data by. Following instructions provided in a computer program. computers are not inherently intelligent, but they are capable of following. Instructions precisely computers are useful for solving problems if a programmer implements a. * (n. b. , his designs were actually mechanical, not electrical) Turing-complete computer 6 take: we have a really good idea of the capabilities of computers. Any other turing machine understanding of those as well. 3. you do not need (and you should not use) a computer to write an. Algorithm: ada lovelace did not have an analytical engine when she wrote her bernoulli, peter shor did not have a quantum computer when he wrote his prime.
