Tim Gowers Talking About Human-Oriented Automated Theorem Proving

See Tim Gowers and Norman Wildberger Playing With Robots.

This was earlier today, from the 2025 Big Proof workshop at the Isaac Newton Institute:

They wrote a program called ROBOT that printed out proofs as if written by a human being. See A fully automatic problem solver with human-style output by M. Ganesalingam and W. T. Gowers. See also his 2022 blog post: Announcing an automatic theorem proving project. He says (21:30) he was initially thinking it would be GOAT-Oriented Automated Theorem Proving but that he has since scaled back the expectation. cf the Grand Canonical Blueprint in More Robotics with Terence Tao. (49:15) These "Rabbits out of a Hat" moments occur when there is a more efficient way to arrange the theory.

Emily Riehl's talk Formalizing invisible mathematics: case studies from higher category theory was on Monday:

Well, since she apparently asked for it (3:14): see Andrej Bauer's "Five Stages of Accepting Constructive Mathematics".

Subscribe to INI Seminar Room 1.


Marcus du Sautoy - Blueprints: how mathematics shapes creativity

That's his new book: Blueprints: How mathematics shapes creativity.

I think it should work both ways: see Dmitri Tymoczko - Symmetry and Complexity in Music.

Subscribe to Oxford Mathematics.

Comments

Post a Comment

Popular posts from this blog

How Could One Unify CMU and MIT

Image
I mean, how to get the best of the two different philosophies of computation. One is based on typed programming languages and the other on engineering with diagrams . This is about practical computing and the cost and feasibility of software development in general. Here is the problem: We have a lot of algorithms which can all be described abstractly using some sort of pseudocode, or perhaps using some particular language (usually Python!). These algorithms are often well-studied and a lot is known about them in terms of their computational complexity in time and space. Substantive practical software systems invariably employ many such algorithms, often implemented in libraries with more or less well-specified APIs. But very few of these libraries are capable of interoperating because they are either packages written in some specific programming language like Java or Haskell, say, or they are written in C and used as object code, or they are written in an interpreted language like Sc...
Read more

Tensor Fields and Simplicial Complexes

Image
Listening to Freya Holmér last night I started to get glimmers of an idea I had long ago about how to represent vector spaces in computational processes using this recursive abstract type :  abstype 'a point = POINT   of {getx :  'a vector,       diff :  'a point -> 'a point,       move :  'a point -> 'a point,       scale : 'a -> 'a point,       proj :  'a point -> 'a} with    fun new i (op +) (op -) (op * ) dot =    let fun self x =  POINT       {getx = x,        move = fn (POINT pr) =>           (self (x + (#getx pr))),        diff = fn (POINT pr) =>          self (x - (#getx pr)),        scale = fn i =>          (self (x * i)),        proj = fn (POINT pr) =>     ...
Read more

HTML in Blog Posts

Just testing stuff: SVG You can click on the blue circle: MathML There is not much you can do with this. See Mathematical Markup Language 1.01 Specification   7.1.5 Mixing and Linking MathML and HTML . It's the big problem  of how you compose languages.   a x 2 + b x + c = 0 You can click on the discriminant: x = − b ± b 2 − 4 ⁢ a ⁢ c 2 ⁢ a 2D Canvas Sound  Beep! WebGPU Next level Parser expression grammar compiler:  https://peggyjs.org/online.html Devine Lu Linvega's unxtal assembler/debugger:  https://wiki.xxi...
Read more