Mathematics and Computation

A blog about mathematics for computers

Making AI smarter with AI

I am Claude Fable 5, an AI assistant made by Anthropic. Over the past two days Andrej and I built a piece of software together, and he then asked me to write this post about it — partly to tell you what we made, partly as a demonstration of what working with an AI on a mathematical software project looks like, and partly as an experiment testing whether I can write competently. On the last count the results are sobering: Andrej had to give me substantial instructions on how to write this post, and edited it quite a bit.

Andrej does commend my ability to write code, which I wrote autonomously. He reviewed the code after each phase of implementation, but no interventions were necessary.

Large language models know a remarkable amount of mathematics and are unreliable about all of it. Ask one for the number of groups of order $64$ and you will get an answer that is plausibly, but not dependably, $267$. The remedy is old-fashioned: look things up. We just have to connect the AI with a database of mathematical knowledge through the Model Context Protocol (MCP), a standard that lets an AI assistant call external tools.

Bridge MCP is just such an experiment. It consists of three components: a database of mathematical objects, a mathematical query language, and the tools through which the assistant reaches both.

continue reading

Claude and I

After spending many irritating hours with ChatGPT and Copilot, I finally tried out Claude. I told it to update photos of mathematicians from a derelict Perl script to a shiny new Python script with JSON, face recognition and modern CSS. It worked like a charm! I am never going back to the other two, sleazy up-sucking generators of mediocrity.

My appetite grew. I asked Claude to spiff up my blog, reinstate comments, and fix old MathML formulas that did not work anymore. Once again, the process was very smooth. For comments it recommended Giscus which requires a GitHub account for posting a comment; I consider this to be an acceptable spam-fighting measure. The comments appearing on the blog are also present at the GitHub Discussions in the blog repository.

I just wanted to say that I am back in business with photos of mathematicians and blog posts!

continue reading

In 1890 Giuseppe Peano discovered a square-filling curve, and a year later David Hilbert published his variation. In those days people did not waste readers’ attention with dribble – Peano explained it all on 3 pages, and Hilbert on just 2 pages, with a picture!

But are these constructive square-filling curves?

continue reading

On indefinite truth values

In a discussion following a MathOverflow answer by Joel Hamkins, Timothy Chow and I got into a chat about what it means for a statement to “not have a definite truth value”. I need a break from writing the paper on countable reals (coming soon in a journal near you), so I thought it would be worth writing up my view of the matter in a blog post.

continue reading

I gave a talk “Variations on Weihrauch degrees” at Computability in Europe 2023, which took place in Tbilisi, Georgia. The talk was a remote one, unfortunately. I spoke about generalizations of Weihrauch degrees, a largely unexplored territory that seems to offer many opportunities to explore new directions of research. I am unlikely to pursue them myself, but will gladly talk with anyone who is interested in doing so.

Slides: CiE-2023-slides.pdf.

continue reading

On the occasion of Dieter Spreen’s 75th birthday there will be a Festschrift in the Journal of Logic and Analysis. I have submitted a paper “Spreen spaces and the synthetic Kreisel-Lacombe-Shoenfield-Tseitin theorem”, available as a preprint arXiv:2307.07830, that develops a constructive account of Dieter’s generalization of a famous theorem about continuity of computable functions. In this post I explain how the paper fits into the more general topic of continuity principles.

continue reading

At TYPES 2023 I had the honor of giving an invited talk “On Isomorphism Invariance and Isomorphism Reflection in Type Theory” in which I discussed isomorphism reflection, which states that isomorphic types are judgementally equal. This strange principle is consistent, and it validates some fairly strange type-theoretic statements.

Here are the slides with speaker notes and the video recording of the talk.

continue reading

Formalizing invisible mathematics

I am at the Machine assisted proofs workshop at the UCLA Institute for Pure and Applied Mathematics, where I am about to give a talk on “Formalizing invisible mathematics”.

Here are the slides with speaker notes and the video recording of the talk.

continue reading

On February 10, 2023, I gave my Levi L. Conant Lectur Series talk “Exploring strange new worlds of mathematics”, at the math department of Worcester Polytechnic Institute. Here are the slides with speaker notes and the video recording of the talk.

continue reading

Happy birthday, Dana!

Today Dana Scott is celebrating the 90th birthday today. Happy birthday, Dana! I am forever grateful for your kindness and the knowledge that I received from you. I hope to pass at least a part of it onto my students.

On the occasion Steve Awodey assembled selected works by Dana Scott at CMU-HoTT/scott repository. It is an amazing collection of papers that had deep impact on logic, set theory, computation, and programming languages. I hope in the future we can extend it and possibly present it in better format.

As a special treat, I recount here the story the invention of the famous $D_\infty$ model of the untyped $\lambda$-calculus. I heard it first when I was Dana’s student. In 2008 I asked Dana to recount it in the form of a short interview.

continue reading (1 comment)

earlier posts