University of Cambridge > Talks.cam > Mini Courses in Theoretical Computer Science > Proving program termination (Part 1)

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Proving program termination (Part 1)

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Sam Staton.

This course will survey both old and recently discovered techniques for proving that programs terminate.

This course is made of three parts.

This talk is part of the Mini Courses in Theoretical Computer Science series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Networking Event - Cambridge Social Ventures Cambridge Lovelace Hackathons Engineering Fluids Group Seminar

Other talks

Black and British Migration CANCELLED: How and why the growth and biomass varies across the tropics Martin Roth: »Widerrede!« Poison trials, panaceas and proof: debates about testing and testimony in early modern European medicine On Classical Tractability of Quantum Schur Sampling The role of myosin VI in connexin 43 gap junction accretion Structural basis for human mitochondrial DNA replication, repair and antiviral drug toxicity Katie Field - Symbiotic options for the conquest of land Fumarate hydratase and renal cancer: oncometabolites and beyond The ‘Easy’ and ‘Hard’ Problems of Consciousness The Chemistry of Planet Formation and the Making of Habitable Planets
 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity