50 likes | 207 Views
600.103 Solutions to Homework #1. Kenneth.Church@jhu.edu. Sqrt (4) . Newton’s Method. x1 > 0 2 x1 < 0 -2 x1 = 0 NaN. R & Fib. F(15)=610. Halting Problem. What does this have to do with computability? The Halting Problem demonstrates that you cannot compute everything
E N D
600.103 Solutions to Homework #1 Kenneth.Church@jhu.edu
Newton’s Method • x1 > 0 2 • x1 < 0 -2 • x1 = 0 NaN
R & Fib • F(15)=610
Halting Problem • What does this have to do with computability? • The Halting Problem demonstrates that you cannot compute everything • In other words, the set of all computable functions is a proper subset of the set of all functions