'Giorgi japaridze' diaporamas de présentation

The Church-Turing Thesis

Giorgi Japaridze Theory of Computability. The Church-Turing Thesis. Episode 1. 1.1.a. Giorgi Japaridze Theory of Computability. Components of a Turing machine (TM). a a b a b b - - - - - -. (Q, ? , ? , ? ,start,accept,reject).

6.48k views • 647 slides

Decidability

Giorgi Japaridze Theory of Computability. Decidability. Episode 2. 2.1.a. Giorgi Japaridze Theory of Computability. Decidable: {1,3,5} ? {x | x is even} {x | x is a perfect square} {x | x 2 -10x = 0} {x | x=y * z for some integers y,z>1 (i.e. x is not prime)}

152 views • 14 slides

Reducibility

Giorgi Japaridze Theory of Computability. Reducibility. Episode 3. 3.1.a. Giorgi Japaridze Theory of Computability. The undecidability of the halting problem. Let HALT TM = {<M,w> | M is a TM and M halts on input w } HALT TM is called the halting problem.

313 views • 10 slides

Decidability

Giorgi Japaridze Theory of Computability. Decidability. Episode 2. 2.1.a. Giorgi Japaridze Theory of Computability. Decidable: {1,3,5} ? {x | x is even} {x | x is a perfect square} {x | x 2 -10x = 0} {x | x=y * z for some integers y,z>1 (i.e. x is not prime)}

262 views • 6 slides

Giorgi Japaridze Theory of Computability

373 views • 6 slides

Relativization

Giorgi Japaridze Theory of Computability. Relativization. Section 9.2. 9.2.a. Giorgi Japaridze Theory of Computability. Oracle Turing machines. Definition 9.17 An oracle for a language A is device that is capable of reporting

179 views • 5 slides

Giorgi Japaridze Theory of Computability

Giorgi Japaridze Theory of Computability. Space Complexity. Section 8.0. 8.0.a. Giorgi Japaridze Theory of Computability. Space complexity defined. Definition 8.1 Let M be a deterministic Turing machine that halts on

47 views • 4 slides