Meeting 3.2: Computability

From Eric Samperton 2/11/2021

38 plays 0 comments

I discuss the definition of computability via Turing machines, and a couple of examples and non-examples of computable problems in geometric topology.

Tags

Date of creation: 2/11/2021 12:00 AM
Appears In: MATH 595 - Quantum Complexity and Topology

Comments
Related Media

Loading…

	Contact Technology Services to report an issue, offer feedback, or request assistance.
	Technology Services Home \| Kaltura Help \| Privacy Policy
	Illinois Media Space, © 2022 Board of Trustees of the University of Illinois

Meeting 3.2: Computability

Related Media