Uploaded March 2018 | Updated September 2026, 58 minutes ago
This lecture is part of a course on the Theory of Computation, by Professor Gabriel Robins at the University of Virginia (CS6160 Spring 2018), with PowerPoint slides at http://www.cs.virginia.edu/~robins/cs6160/ and other related videos at http://www.cs.virginia.edu/robins/videos.html
Specific topics covered in this lecture: Hilbert and his list of open problems, the continuum hypothesis, consistency of the axioms, polyhedra dissections, axiomatization of physics, transcendental numbers, Riemann hypothesis, Goldbach's conjecture, Hilbert's Tenth Problem, Diophantine equations, Matiyasevich, universal polynomials, degree vs. dimension tradeoffs, Julia Robinson, space-filling tilings, sphere packing, aperiodic tilings, Penrose tilings, 3D tilings, tiling undecidability, gallery of aperiodic tilings, DARPA-hard problems, quantum computers
This lecture is part of a course on the Theory of Computation, by Professor Gabriel Robins at the University of Virginia (CS6160 Spring 2018), with PowerPoint slides at http://www.cs.virginia.edu/~robins/cs6160/ and other related videos at http://www.cs.virginia.edu/robins/videos.html
Specific topics covered in this lecture: Hilbert and his list of open problems, the continuum hypothesis, consistency of the axioms, polyhedra dissections, axiomatization of physics, transcendental numbers, Riemann hypothesis, Goldbach's conjecture, Hilbert's Tenth Problem, Diophantine equations, Matiyasevich, universal polynomials, degree vs. dimension tradeoffs, Julia Robinson, space-filling tilings, sphere packing, aperiodic tilings, Penrose tilings, 3D tilings, tiling undecidability, gallery of aperiodic tilings, DARPA-hard problems, quantum computers
