PROBLEM SOLVING
CS+X 2017 AARON STOCKDILL
PROBLEM SOLVING 2 CS+X 3 CS+X SCULPTURE GEOLOGY FINANCE - - PowerPoint PPT Presentation
CS+X 2017 AARON STOCKDILL PROBLEM SOLVING 2 CS+X 3 CS+X SCULPTURE GEOLOGY FINANCE MATHEMATICS COMPUTER SCIENCE 4 CS+X Problem Computer Mathematics Solving Science 5 CS+X What does it mean to solve a problem? Exploring
CS+X 2017 AARON STOCKDILL
CS+X 2
CS+X 3
GEOLOGY SCULPTURE FINANCE MATHEMATICS COMPUTER SCIENCE
CS+X 4
Mathematics Computer Science Problem Solving
CS+X 5
What does it mean to solve a problem? Exploring languages with compression Problems we can't solve
6
CS+X
WHAT IS COMPUTER SCIENCE?
7
Computer science is the study of the theory, experimentation, and engineering that form the basis for the design and use of computers.
From Wikipedia, the free encyclopedia
Computer science is as much about computers as astronomy is about telescopes.
Edsger Dijkstra, supposedly…
CS+X
WHAT IS A COMPUTER?
8
CS+X
WHAT IS A COMPUTER?
9
Turing Machine Lambda (λ) Calculus
λf.(λx.(f(x x))λx.(f(x x)))
CS+X
CHURCH-TURING THESIS
10
“A problem can be solved by an algorithm iff it can be solved by a Turing Machine” Lambda Calculus Magic: The Gathering Music notation
CS+X
ALGORITHM ≡ FORMAL SEQUENCE OF STEPS
11
was_boring = False while speaker.is_speaking(): self.listen() if speaker.is_boring(): self.boo() was_boring = True if not was_boring: self.cheer()
12
CS+X
LANGUAGES CAN BE SIMILAR
13
Portuguese
Olá, estou bem
Spanish
Hola, estoy bien
German
Hallo, mir geht es gut
CS+X
WHAT DOES “SIMILAR” MEAN?
14
NCDZ(x, y) = Z(xy) − min{Z(x), Z(y)} max{Z(x), Z(y)}
“How similarly do two different things compress?”
CS+X
UNIVERSAL DECLARATION OF HUMAN RIGHTS
15
CS+X
GENERAL CATEGORISATION ALGORITHM
16
Genomes / Phylogenetics Plagiarism Music Genres Determining File Types
17
CS+X
COMPLEXITY
18
?
CS+X
COMPLEXITY
19
MST all vertices sorting searching point-to-point shortest path primality gcd 2-SAT 3-SAT travelling salesman timetabling MST some vertices Super Mario bin packing P NP
CS+X
COMPLEXITY
20
MST all vertices sorting searching point-to-point shortest path primality gcd 2-SAT 3-SAT travelling salesman timetabling MST some vertices Super Mario bin packing P NP
CS+X
UNCOMPUTABLE FUNCTIONS
21
The Halting Problem Kolmogorov Complexity Busy Beaver Chaitin’s Constant
CS+X 2017 AARON STOCKDILL