Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
Last revisionBoth sides next revision
18cs493 [2018-07-22] – [Synopsis] Martin Ziegler18cs493 [2018-07-25] – [E-Learning] Martin Ziegler
Line 52: Line 52:
   * Thu, July 26, 12:10-13:00    * Thu, July 26, 12:10-13:00 
 in E3-1 #3444 in E3-1 #3444
-{{ ::18cs493d.pdf |}}==== Synopsis ==== +==== Synopsis ==== 
-  - {{18cs493a.pdf|Introduction and Motivation}} +  - {{18cs493a.pdf|Introduction and Motivation}} ({{18cs493a.ppt|ppt}}) 
-  - {{18cs493b.pdf|Discrete Computation}}: +  - {{18cs493b.pdf|Discrete Computation}} ({{18cs493b.ppt|ppt}})
     * Halting Problem     * Halting Problem
     * Un/Semi/Decidability/Enumerability      * Un/Semi/Decidability/Enumerability 
Line 61: Line 61:
     * Complexity classes P, NP, EXP     * Complexity classes P, NP, EXP
     * (Polynomial-time) Reduction     * (Polynomial-time) Reduction
-  - {{18cs493c.pdf|Computing over the Reals}}+  - {{18cs493c.pdf|Computing over the Reals}} ({{18cs493c.ppt|ppt}})
      * Computable Real numbers: non/equivalent notions      * Computable Real numbers: non/equivalent notions
      * Equality, real sequences and limits      * Equality, real sequences and limits
Line 67: Line 67:
      * Computational cost, compactness, and continuity      * Computational cost, compactness, and continuity
      * Uncomputable derivative      * Uncomputable derivative
-  - {{18cs493d.pdf|Exact Real Computation}}+  - {{18cs493d.pdf|Exact Real Computation}} ({{18cs493d.ppt|ppt}})
      * Non-extensionality, discrete enrichment      * Non-extensionality, discrete enrichment
      * Semantics of tests and choose()      * Semantics of tests and choose()
      * iRRAM library      * iRRAM library
      * Example Algorithms      * Example Algorithms
-  - {{18cs493e.pdf|Real Complexity Theory}}+  - {{18cs493e.pdf|Real Complexity Theory}} ({{18cs493e.ppt|ppt}})
      * Polynomial-time reals      * Polynomial-time reals
      * Polynomial-time functions      * Polynomial-time functions
Line 97: Line 97:
   * {{18cs493ii.pdf|Homework #2}} consists of one large problem to be solved and submitted in English **on paper** in the lecture on July 17 (Tuesday)    * {{18cs493ii.pdf|Homework #2}} consists of one large problem to be solved and submitted in English **on paper** in the lecture on July 17 (Tuesday) 
   * {{18cs493iii.pdf|Homework #3}} consists of two problems. Problem 6 is to be solved and submitted in English **on paper** in the lecture on July 24 (Tuesday). Problem 7 is to be solved and submitted in English via [[mailto:cs493@theoryofcomputation.asia|email]] before the lecture on July 24 (Tuesday).   * {{18cs493iii.pdf|Homework #3}} consists of two problems. Problem 6 is to be solved and submitted in English **on paper** in the lecture on July 24 (Tuesday). Problem 7 is to be solved and submitted in English via [[mailto:cs493@theoryofcomputation.asia|email]] before the lecture on July 24 (Tuesday).
 +  * {{18cs493exam.pdf|Written Exam}}