1 / 24

Computer Science 500 Theory of Computation Spring, 2000 Monday, February 7 Reminder: Test on 2

Context-Free Grammars example. {A0 A 1 }{AB}{B

rowena
Download Presentation

Computer Science 500 Theory of Computation Spring, 2000 Monday, February 7 Reminder: Test on 2

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

    1. Computer Science 500 Theory of Computation Spring, 2000 Monday, February 7 Reminder: Test on 2/14

    2. Context-Free Grammars example

    6. States and a tape

    12. Turing Machines -- definition

    13. T.M. M accepts w iff M enters the accept state while computing on w We will also use “M(w) = 1”

    14. Decidability

    22. Assume that there is a 1-to-1 function from Z+ to R[0,1]

    23. definitions

    24. X = . g(f(1)1) g(f(2)2) g(f(3)3) … Suppose there exists a value k s.t. f(k) = X f(k)k = Xk f(k) = X

More Related