An Excellent Talk about Computability and Hilbert's Entscheidungsproblem
He calls it the entschuldigungsproblem though. My comment : 7:15 Jenann Ismael gave a talk at Johns Hopkins last year entitled "Cracks in the edifice of determinism" where she argues that this sort of self-reference produces questions which have no meaningful answer. There then arises the question as to how much one can reasonably deduce about physical processes (such as computation) based on their demonstrated inability to answer such questions. See Jenann Ismael - Laplace meets Godel: How Self reference Foils Prediction for more details and a suggestion as to a better way to define "effectively calculable" that does not depend on our incomplete knowledge of physics. Subscribe to Computable Secrets . Subscribe to Hopkins Natural Philosophy Forum . See Dana Scott on Lattice Fixpoint Semantics and Gopal Gupta on Logic, Co-induction and Infinite Computation . On Monday, Aug. 29, 2016 in Berkely, Dana Scott gave a lecture on a model ...