BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Too Good to be True? Precisely! The Real Cost of Non-Standard Comp
 utation - Ed Blakey (University of Bristol)
DTSTART:20120202T141500Z
DTEND:20120202T151500Z
UID:TALK35409@talks.cam.ac.uk
CONTACT:Paul Skrzypczyk
DESCRIPTION:Certain (unconventional\, non-Turing) computers give the illus
 ion of efficiency\, whilst being fundamentally impracticable. The illusion
  stems from the computers’ polynomial time and space complexity\, the im
 practicability from their <i>exponential</i> complexity with respect to co
 mputational resources other than time and space (precision\, for example\,
  is such a resource). From previous research\, we recap a paradigm- and re
 source-independent framework of computational complexity that dispels this
  illusion. From immanent research\, we mention an application of the frame
 work to Shor’s algorithm (the question here is ‘what is the precision 
 complexity of Shor’s algorithm?’). And from proposed research\, we des
 cribe an extension of the framework from complexity-theoretic to cryptogra
 phic concerns.
LOCATION:MR4\, Centre for Mathematical Sciences
END:VEVENT
END:VCALENDAR