University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Complexity of computations and proofs and pseudo-finite structures

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

Complexity of computations and proofs and pseudo-finite structures

Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani .

Semantics and Syntax: A Legacy of Alan Turing

Problems to establish lower bounds for circuit size or for lengths of propositional proofs can be formulated as problems to construct expansions of pseudo-finite structures. I will explain this relation, give a few examples, and discuss some recent work aimed at proof complexity.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Senior Parlour, Gonville & Caius College Room FW 11, Willam Gates Hall. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Mill Lane Lecture Rooms (Room 4), University of Cambridge, 1 Mill Lane, Cambridge CB21

Other talks

Title to be confirmed Title to be confirmed Scientific Steering Committee meeting Cooperation for Nature Afternoon Break Optimal metric and approximation of free boundary minimal surfaces
 

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