Skip to the Main Content

Note:These pages make extensive use of the latest XHTML and CSS Standards. They ought to look great in any standards-compliant modern browser. Unfortunately, they will probably look horrible in older browsers, like Netscape 4.x and IE 4.x. Moreover, many posts use MathML, which is, currently only supported in Mozilla. My best suggestion (and you will thank me when surfing an ever-increasing number of sites on the web which have been crafted to use the new standards) is to upgrade to the latest version of your browser. If that's not possible, consider moving to the Standards-compliant and open-source Mozilla browser.

March 9, 2007

Classical vs Quantum Computation (Week 17)

Posted by John Baez

Yay! In this week’s course on Classical vs Quantum Computation, we finally reached the promised land: surface diagrams — closely resembling string worldsheets! — illustrating ‘processes of computation’:

  • Week 17 (Mar. 8) - 2-categories from typed λ-calculi. For each type, a category of terms of that type, freely generated by rewrite rules. Example: high-school calculus. Confluence and termination. Surface diagrams showing the process of computation.

    Supplementary reading:

    • Joachim Lambek and Phil Scott, Introduction to Higher-Order Categorical Logic, Cambridge U. Press, 1988. Part 1, Sections 12-14: the decision problem for equality; the Church-Rosser property for bounded terms; all terms are bounded.

Last week’s notes are here; next week’s notes are here.

Posted at March 9, 2007 12:17 AM UTC

TrackBack URL for this Entry:   http://golem.ph.utexas.edu/cgi-bin/MT-3.0/dxy-tb.fcgi/1195

0 Comments & 1 Trackback

Read the post Classical vs Quantum Computation (Week 18)
Weblog: The n-Category Café
Excerpt: Surface diagrams showing the process of computation.
Tracked: March 15, 2007 10:51 PM

Post a New Comment