PROBLEM SOLVING 2 CS+X 3 CS+X SCULPTURE GEOLOGY FINANCE - - PowerPoint PPT Presentation

problem solving 2 cs x
SMART_READER_LITE
LIVE PREVIEW

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


slide-1
SLIDE 1

PROBLEM SOLVING

CS+X 2017 AARON STOCKDILL

slide-2
SLIDE 2

CS+X 2

slide-3
SLIDE 3

CS+X 3

GEOLOGY SCULPTURE FINANCE MATHEMATICS COMPUTER SCIENCE

slide-4
SLIDE 4

CS+X 4

Mathematics Computer Science Problem Solving

slide-5
SLIDE 5

CS+X 5

What does it mean to solve a problem? Exploring languages with compression Problems we can't solve

slide-6
SLIDE 6

6

WHAT DOES IT MEAN TO SOLVE A PROBLEM?

slide-7
SLIDE 7

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…

slide-8
SLIDE 8

CS+X

WHAT IS A COMPUTER?

8

slide-9
SLIDE 9

CS+X

WHAT IS A COMPUTER?

9

Turing Machine Lambda (λ) Calculus

λf.(λx.(f(x x))λx.(f(x x)))

slide-10
SLIDE 10

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

slide-11
SLIDE 11

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()

slide-12
SLIDE 12

12

EXPLORING LANGUAGES WITH COMPRESSION

slide-13
SLIDE 13

CS+X

LANGUAGES CAN BE SIMILAR

13

Portuguese

Olá, estou bem

Spanish

Hola, estoy bien

German

Hallo, mir geht es gut

slide-14
SLIDE 14

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?”

slide-15
SLIDE 15

CS+X

UNIVERSAL DECLARATION OF HUMAN RIGHTS

15

slide-16
SLIDE 16

CS+X

GENERAL CATEGORISATION ALGORITHM

16

Genomes / Phylogenetics Plagiarism Music Genres Determining File Types

slide-17
SLIDE 17

17

PROBLEMS WE CAN'T SOLVE

slide-18
SLIDE 18

CS+X

COMPLEXITY

18

P = NP

?

slide-19
SLIDE 19

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

slide-20
SLIDE 20

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

slide-21
SLIDE 21

CS+X

UNCOMPUTABLE FUNCTIONS

21

The Halting Problem Kolmogorov Complexity Busy Beaver Chaitin’s Constant

slide-22
SLIDE 22

PROBLEM SOLVING

CS+X 2017 AARON STOCKDILL