LFCS seminar: Dr. Chris Heunen: Approximating transition systems
Dr. Chris Heunen, Oxford University. Approximating transition systems
What 


When 
Mar 19, 2015 from 11:00 AM to 12:00 PM 
Where  4.31/4.33 
Add event to calendar 
vCal iCal 
Abstract: Classical computation, invertible computation, probabilistic computation, and quantum computation, form increasingly more sophisticated labelled transition systems. How can we approximate a transition system by less sophisticated ones? Considering all ways to get probabilistic information out of a quantum system leads to domaintheoretic ideas, that also apply in the accompanying Boolean logic. I will survey to what extent these domains characterise the system, leading with examples from quantum theory, in a way that is accessible to a broad audience of computer scientists, mathematicians, and logicians.