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.

January 5, 2007

Classical vs Quantum Computation (Week 9)

Posted by John Baez

Here are the first of the Winter quarter notes on Classical versus Quantum Computation. This quarter we’ll start categorifying everything we did last time!

  • Week 9 (Jan. 4) - Brief review of categories and computation: objects as data types, morphisms as equivalence classes of programs. Why we must categorify our work so far to see computation as a process. The strategy of categorification. Categorifying the concept of ‘monoid’ to get the concept of ‘monoidal category’. Categorifying the concept of ‘category’ to get the concept of ‘(weak) 2-category’ (also known as ‘bicategory’).

Last week’s notes are here.

There won’t be any seminar next week, since some of will be at the workshop on Higher Categories and their Applications in Toronto. We’ll continue the week after next.

Posted at January 5, 2007 12:18 AM UTC

TrackBack URL for this Entry:

0 Comments & 1 Trackback

Read the post Classical vs Quantum Computation (Week 8)
Weblog: The n-Category Café
Excerpt: How Curry's Fixed Point Theorem is related to Cantor's diagonal argument.
Tracked: January 5, 2007 12:56 AM

Post a New Comment