Sign in

Noam Zeilberger

@noamzoam.mathstodon.xyz.ap.brid.gy
42 followers 4 following 49 posts

Computer science theorist and mathematician interested in the connections between things. Assistant professor in the LIX lab at Ecole Polytechnique. [bridged from mathstodon.xyz/@noamzoam on the fediverse by fed.brid.gy ]

PostsRepliesMedia
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 21/09/2026
Blas Jaime, the last known native speaker of the Chaná language, sadly passed away a few days ago at the age of 92. obituary (in Spanish): www.elonce.com/sociedad/murio-blas-… Wikipedia article on […]
mathstodon.xyz
Original post on mathstodon.xyz
000
Reposted by Noam Zeilberger
Jakob @jdw.mathstodon.xyz.ap.brid.gy · 11/09/2026
RE: mathstodon.xyz/@highergeometer/1172… So what's the takeaway from this? Never upload anything of value to the internet anymore? So many people in math over the last 30 years put so much time into writing amazing lecture notes and have been putting them on the internet […]
mathstodon.xyz
Original post on mathstodon.xyz
003
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 18/08/2026
Got around to listening to this episode of aboutlogic with Dana Scott, interviewed by Thorsten Altenkirch and Deniz Sarikaya: www.youtube.com/watch?v=opLbbZ-_AWE It is always a pleasure to hear Scott talking about intellectual history, he gives such a vivid and lucid account (even at […]
mathstodon.xyz
Original post on mathstodon.xyz
000
Reposted by Noam Zeilberger
Greg Restall @consequently.hcommons.social.ap.brid.gy · 04/08/2026
I noticed that in the last day or so I’d got increased traffic to my rarely-visited personal site. Quite a few folks were reaching the home page, and a surprising number were landing on an old post of mine from 2004 about Haskell. Why on earth did _that_ happen? Well, on August 2, John […]
hcommons.social
Original post on hcommons.social
043
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 29/07/2026
I wrote an answer to a MathOverflow question, "Was a computational hardness argument ever used to solve a mathematical conjecture?", mentioning @tito's work on negatively resolving BV = pomset logic. mathoverflow.net/a/513714/1015
mathoverflow.net
Was a computational hardness argument ever used to solve a mathematical conjecture?
Let $P$ be a property of positive integers. Suppose that $P(n)$ can be decided in finite time, but all known algorithms take a long time. Based on experiments done so far, it is conjectured that $P...
010
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 14/07/2026
Today I had the opportunity to give a talk at CT 2026 (ct2026.com) about our paper with Bryce Clarke and Gabriel Scherer on "The free bifibration on a functor" (arxiv.org/abs/2511.07314). Here are the slides […] [Original post on mathstodon.xyz]
slide: 23/33
caption: the three order-preserving maps 2 -> 2 and corresponding focused stacksslide: 29/33
caption: exhaustive enumeration of morphisms S => T as maximally multifocused stacksslide: 28/33
caption: plane tree morphism as maximally multifocused stackslide: 31/33
caption: a morphism in Bif(i, Δepi, Δmono) and the corresponding refinement of NCPs
010
Reposted by Noam Zeilberger
James Grimmelmann @jtlg.bsky.social · 19/05/2026
It was fun talking about generative AI and legal interpretation tonight at Pint of Science. Here are my slides: james.grimmelmann.net/talks/2026-0...
082
Reposted by Noam Zeilberger
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 10/03/2026
I wrote a letter to Knuth asking about this, and he wrote back!
From: Maggie McLoughlin <mam@CS.Stanford.EDU>
To: noam.zeilberger@polytechnique.edu
Subject: from Prof Knuth re your letter of 11 Feb 20256
Reply-to: knuth-bug@cs.stanford.edu
Date: Fri, 27 Feb 2026 13:10:27 -0800

Hi Noam. [Are you any relation to my friend Doron?]

Many thanks for your flattering letter. I fear that you have an
exaggerated view of my competence; yet of course I'm delighted to
know that somebody understands what I was trying to say.

I'd forgotten about deleting those paragraphs from the original
preface to Volume 1. In the desk copy of the 33rd printing of the
second edition, I'd marked only one change (besides additions
to the list of abbreviations for commonly cited journals):
  pure mathematical problems historically have always developed from
   ->  pure mathematical problems almost always owe their origins to
[Probably that change went into one of the published errata.]

Evidently in 1997, after Silvio Levy had presented me with TeX
versions of the various parts of Volume 1 so that I could finally
make a third edition, I edited the preface by first adding a paragraph
(apologizing for being forced to leave things out because CS
had been growing so rapidly). Naturally I also then looked for
parts of the preface that no longer needed to be said. And I
guess I'd come to the conclusion that mathematicians had by then
come to understand the material that you've quoted from the
earlier prefaces.About Ulam's article: I don't actually recall reading any articles
in the September 1964 Scientific American except Martin Gardner's
column [which Martin intentionally made "as unmathematical as
possible" that month ... it's about puns and palindromes].
No doubt if I had time today, I'd find the articles by Courant,
Davis, Kline, Sawyer, Kac, Quine, Dyson, Bellman, and Ulam quite
inspiring. [wow, what a collection of great expositors and thinkers!]

I wouldn't have written many of the sentences of Ulam that you
quoted. ("It is preferable to regard the computer as a handy
device for manipulating and displaying symbols.") An interesting
thought, but it's never entered my head.

I met Stan (and visited his Sante De home) in 1976, and we got along
great. He's wonderfully creative, and by now I've read many of his
books and papers.

I think the main other person who influenced my original preface,
besides my mentor de Bruijn (a frequent visitor to Caltech), was
George Forsythe. You can get an idea of the ideas that I thank
him for the most by looking at the bio that I wrote in CACM when
he died suddenly in 1972.

Cordially, Don Knuth

PS You say you're "eagerly looking forward to reading Volumes
5 and 6". But I'm currently in the midst of 4C, and that will by
no means be the end of Volume 4...
010
Reposted by Noam Zeilberger
robinhouston @robinhouston.mathstodon.xyz.ap.brid.gy · 21/02/2026
Very interesting, and characteristically careful and hype-free, from Daniel Litt on how good current AI models really are or aren't at mathematical research. (He cautiously decides that they're probably a bit better than he thought.) […]
mathstodon.xyz
Original post on mathstodon.xyz
131
Reposted by Noam Zeilberger
Tom de Jong @de-jong-tom.mathstodon.xyz.ap.brid.gy · 13/02/2026
With apologies for the delay, the recordings of the talks at the Types and Topology Workshop in celebration of @MartinEscardo's 60th birthday (tdejong.com/mhe60) are now on YouTube (where available) 📺 www.youtube.com/@mhe60/videos (also linked from the workshop webpage) Many […]
mathstodon.xyz
Original post on mathstodon.xyz
053
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 12/02/2026
The arXiv's new "make everyone write in English to promote linguistic diversity" policy went into effect yesterday (blog.arxiv.org/2026/01/13/non-engli…), and they have now released a feedback survey […]
mathstodon.xyz
Original post on mathstodon.xyz
026
Reposted by Noam Zeilberger
Open Access Tracking Project @oatp.fediscience.org.ap.brid.gy · 09/02/2026
The CNRS is breaking free from the Web of Science | CNRS www.cnrs.fr/en/update/cnrs-breaking…
cnrs.fr
The CNRS is breaking free from the Web of Science
From January 1st 2026, the CNRS will cut access to one of the largest commercial bibliometric databases, Clarivate Analytics'
045
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 05/02/2026
[knuth, ulam, computers + math] While looking for some sources to help motivate the study of computer programming to very young undergraduate students, I ended up reading the preface to Volume 1 of Knuth's _The Art of Computer Programming_ -- in an electronic copy of the Second Printing from […]
mathstodon.xyz
Original post on mathstodon.xyz
211
Reposted by Noam Zeilberger
ploum @ploum.mamot.fr.ap.brid.gy · 19/01/2026
Giving University Exams in the Age of Chatbots How I managed to give an exam while giving the students the choice to use a chatbot or not. And what I learned in the process. ploum.net/2026-01-19-exam-with-chat…
ploum.net
Giving University Exams in the Age of Chatbots
Giving University Exams in the Age of Chatbots par Ploum - Lionel Dricot.
717118
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 15/01/2026
RE: mastoxiv.page/@arXiv_mathCT_bot/115… Another article uploaded to the arXiv (technically, being updated) in a non-English language, making me think about how this policy change will soon go into effect […]
mathstodon.xyz
Original post on mathstodon.xyz
003
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 02/01/2026
RE: mathstodon.xyz/@slava/1158226310933… I for one am eagerly looking forward to Volume 5 of The Art of Computer Programming, on "Lexical scanning" and "Parsing techniques". Hopefully Knuth will get around to finishing it in the next couple years, before he's 90! […]
mathstodon.xyz
Original post on mathstodon.xyz
110
Reposted by Noam Zeilberger
Tom de Jong @de-jong-tom.mathstodon.xyz.ap.brid.gy · 18/12/2025
The slides for Types and Topology (tdejong.com/mhe60) are all up on the website now (where available)! @MartinEscardo
tdejong.com
Types and Topology: A workshop in honour of Martín Escardó's 60th birthday
123
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 12/12/2025
I just spent a fun few days in Glasgow, where I was in town for Malin Altenmüller's (maltenmuller.github.io) successful viva at Strathclyde! I really enjoyed Malin's thesis work and it's always a pleasure to visit the @mspstrath.
maltenmuller.github.io
Malin Altenmüller
002
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 05/12/2025
Une autre époque
Book cover "Programmes d'intelligence artificielle en BASIC"Title page, "Programmes d'intelligence artificielle en BASIC" by Marie Gaëlle MONTEIL and Richard SCHOMBERG, 1985A glance at the table of contents, including chapter sections such as "Les Tours de Hanoï" and a chapter on Tic-Tac-ToeBASIC code for towers of Hanoi
000
Reposted by Noam Zeilberger
soaproot @soaproot.sfba.social.ap.brid.gy · 03/12/2025
@noamzoam The blog post is a delightful read. True the policy change took longer than it should have, but it is a story of perseverance and eventual success (and some great stories of how mathematicians were able to balance career and family).
001
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 03/12/2025
RE: social.sciences.re/@pyviv/115655070… I did not realize that CIRM had a "no babies" policy until as recently as 2015. Thankfully, this has changed. Viviane Pons describes the process in this blog post (in English).
social.sciences.re
101
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 27/11/2025
[teaching / functional programming project / Lambek calculus / new AI vs old AI] Every year in my functional programming course I assign a mini-project for students to complete in small groups, as a significant portion of their course grade. The topic varies […] [Original post on mathstodon.xyz]
sample Lambek / Montague style lexicon from the project description page.sample Lambek calculus derivation from the project description page.
010
Reposted by Noam Zeilberger
Tom de Jong @de-jong-tom.mathstodon.xyz.ap.brid.gy · 24/10/2025
@MartinEscardo is turning 60 this year! In celebration, Eric Finster and I are organizing a two-day workshop on 17-18 December 2025 at the University of Birmingham. tdejong.com/mhe60 The full list of over 20 invited speakers can be found on the website and reflects Martín's diverse […]
mathstodon.xyz
Original post on mathstodon.xyz
011
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 17/10/2025
Are you a PhD student registered in a US institution and interested in conducting part of your doctoral research (4-9 months) in France? Then consider applying for a Chateaubriand Fellowship! chateaubriand-fellowship.org
chateaubriand-fellowship.org
Chateaubriand Fellowship
1210
Reposted by Noam Zeilberger
Timothy Gowers @wtgowers.mathstodon.xyz.ap.brid.gy · 01/10/2025
I've just realized that I missed a trick by not posting here on Mastodon about a project to create a database of "motivated proofs", which has received funding from the AI for Math Fund, a joint venture of Renaissance Philanthropies and XTX Markets. Very roughly, that means not just proofs but […]
mathstodon.xyz
Original post on mathstodon.xyz
005
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 26/09/2025
Visited the library of the Institut Henri Poincaré yesterday, and they had a small rack with free-for-taking copies of some old journals. Was delighted to find a copy of the issue of Communications of the ACM containing the original article on Hoare logic!
cover of Communications of the ACM, Volume 12, Number 10, October 1969, with the stamp of the library of the Institut Henri Poincarétable of contents of Communications of the ACM, Volume 12, Number 10, October 1969. There is a small blue line marked next to the article by C. A. R. Hoare, "An Axiomatic Basis for Computer Programming".Perspective view of first two pages of Hoare's "An Axiomatic Basis for Computer Programming".
131
Reposted by Noam Zeilberger
theHigherGeometer @highergeometer.mathstodon.xyz.ap.brid.gy · 18/08/2025
Mike Wright has been a long-time recorder of talks at conferences, including category theory conferences. He has a huge archive of recordings (>100k hours) and needs support to digitise them and make the archive freely available online. There are talks going back 50 years, and the project will […]
mathstodon.xyz
Original post on mathstodon.xyz
217
Reposted by Noam Zeilberger
robinhouston @robinhouston.mathstodon.xyz.ap.brid.gy · 29/07/2025
An interesting MO question from @noamzoam, that someone here might know the answer to. mathoverflow.net/questions/498407/o…
mathoverflow.net
On Joyal's definition of a category of plane trees
I'm trying to understand better the motivation for the definition of the category $Trees$ of finite plane trees in Joyal's unpublished manuscript "Disks, duality and Θ-categories" (1997, ...
101
Reposted by Noam Zeilberger
Pablo Donato @pablogician.social.sciences.re.ap.brid.gy · 29/07/2025
Every logician knows about Peirce’s law, this curious tautology equivalent to the law of excluded middle that uses only the implication connective. Less known is that around 1896, Peirce invented the first diagrammatic proof system in history, predating string diagrams in category theory and […]
social.sciences.re
Original post on social.sciences.re
022
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 25/07/2025
A lesser known fact about Saunders Mac Lane is that he wrote a thesis in logic, completed in 1933 at Göttingen under the direction of Bernays and Weyl. I'm at the library and pulled out a copy of "Saunders Mac Lane : Selected Papers", which in addition to […] [Original post on mathstodon.xyz]
After a year I left Chicago to go to Göttingen where I hoped that the environment of Hilbert would give more encouragement to my study of logic and rigor. By then I must have vaguely begun to see that a good proof consisted of more than just rigorous detail, because there was also an important element of plan for the proof -- the crucial ideas, which, over and above the careful detail, really make the proof function and get to the desired end. I clearly recall sitting in a vast lecture room listening to Edmund Landau lecture on Dirichlet series. As always, Landau's proofs were simply careful lists of one detail after another, but he gave this detail with such exemplary care that I could both copy down in my notebook all the needed detail and enter in the margin some overarching description of the plan of his proof (a plan which he never directly revealed).

Then I came gradually to the insight that proofs in mathematics combined rigorous detail and overall plan -- and that overweening attention to the precision of detail could, as in the case of \emph{Principia}, wholly hide the plan. There arose with me the notion that the necessary rigor could be codified and simplified, so as to be made almost automatic. If only the automatic could be properly described and organized, then the essential ideas of the proof would come through. This idea of organizing the \emph{plan} of a proof in a formal way was evidently the germ of my thesis.
I explained it to them in Vienna, where I thought that Rudolph Carnap would be more sympathetic. Instead, I thought very hard in spurts about a thesis. A decisive spurt came on April 18--22, when I finally worked out a plan of the final thesis. In an exuberant letter of April 26th to my mother I wrote:
\begin{quote}
  ``Perhaps I have time to tell you a bit about my new discovery. It's a new symbolic logic for \emph{mathematical proofs.} It applies, as far as I can see now, to all proofs in all branches of mathematics (a rather big order!). It makes it possible to write down the proof of a theorem in a very much shorter space than by the usual methods, and at the same time it makes the proof very much clearer. In essence, it eliminates practically \emph{all} the long mechanical manipulations necessary to prove a theorem. It is only necessary to give \emph{leading ideas} of the \emph{proof.}  In fact, once these leading ideas are given -- together with a few directions -- then it becomes possible to compute \emph{from} the leading ideas just what the \emph{proof} of the theorem will be. In other words, once these leading ideas are given, all the rest is a purely mechanical sort of job. It is possible to define once and for all how the job is to be carried out (the general definition depends essentially upon the abstract methods I have been developing for the past year).''
\end{quote}On this basis, I described exactly a number of the routine steps in a proof, giving each a label, as for example:
\begin{quote}

  \emph{Inf schrumpf}: To prove a theorem $L \supset P$, search for a prior theorem of the form $M\supset N$, where $L$ is a ``special case'' of $M$ and $P$ the corresponding special case of $M$.

  \emph{Sub inf schrumpf}: Given a prior theorem $M\supset N$, one can conclude that $L\supset L'$, where $L'$ is obtained from $L$ by replacing every ``positive'' component of the form $M$ by a new component $N$.

  \emph{Sub Def}: Substitute the definitions.

  \emph{Identität}: Use one of the standard identities of algebra (or of the propositional calculus).

  \emph{Sub Theorem \#20.43}: Use the cited theorem, in the (only) possible way.

  \emph{$x = C$ fixieren}: Given a premise $(\exists x)L(x)$, assert $L(C)$ for some suitable ``constant'' $C$.

  \emph{Halbnorm}: Move a quantifier $\exists x$ or $\forall x$ to the front of an expression.
\end{quote}
All told the thesis gives twenty or twenty-five of such rules (listed at the start of Chapter VII), and then observes that many proofs can be ``abbreviated'' by listing in order the rules to be applied. In this sense, the thesis gives a formal definition of a routine proof.
121
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 19/05/2025
I've mentioned this paper by @pamellies and myself before, and the main contents are by now 1.5-3 years old, but I'm happy to report that the final version of the paper has at last been published by LMCS: * The categorical contours of the Chomsky-Schützenberger representation theorem […]
mathstodon.xyz
Original post on mathstodon.xyz
001
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 03/05/2025
Somehow ended up clicking to the "Donald Knuth" page on "Celebrity Birthdays", and I wonder how these things are generated.
[dubious text from "Celebrity Birthdays" site.]
Donald Knuth is one of the most popular and richest Mathematician who was born on January 10, 1938 in Wisconsin, Wisconsin, United States. Mathematician and engineer who was arguably most recognized as the Professor Emeritus at Stanford in Palo Alto, California.

Henry Suzzallo once studied at Stanford University, where he served as the Professor Emeritus.[dubious text from "Celebrity Birthdays" site.]
Donald Knuth Net Worth
Net Worth 	$5 Million
Source Of Income 	Mathematician
House 	Living in own house.

Donald Knuth is one of the richest Mathematician from United States. According to our analysis, Wikipedia, Forbes & Business Insider, Donald Knuth 's net worth $5 Million. (Last Update: December 11, 2023)[dubious text from "Celebrity Birthdays" site.]
Height, Weight & Body Measurements

Donald Knuth height Not available right now. Donald weight Not Known & body measurements will update soon.
Who is Donald Knuth Dating?

According to our records, Donald Knuth is possibily single & has not been previously engaged. As of December 1, 2023, Donald Knuth’s is not dating anyone.

Relationships Record : We have no records of past relationships for Donald Knuth. You may help us to build the dating records for Donald Knuth!
010
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 02/04/2025
I gave a tutorial talk today about "(generalized) fibrations for logic, automata and language theory", mainly focused on the automata part. Slides if you are interested: noamz.org/talks/dagstuhl.tutorial.2…
001
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 03/03/2025
just read Oleg Kiselyov's blog post "do-while loops have always been in OCaml" (okmij.org/ftp/ML/index.html#do-while), and laughed out loud when I got to the punchline. I haven't done any OCaml programming in a long time but it makes me want to try it again, surely a beautiful language […]
mathstodon.xyz
Original post on mathstodon.xyz
1104
Noam Zeilberger @noamzoam.mathstodon.xyz.ap.brid.gy · 20/12/2024
I really enjoyed this "Public Address on Generative Linguistics" by Matilde Marcolli: www.youtube.com/watch?v=-gx3SK7FvKk Marcolli is a mathematical physicist and recent [!] collaborator of Noam Chomsky. This lecture from Oct 2023 is broadly about […] [Original post on mathstodon.xyz]
slide from Matilde Marcolli talk

What does one gain from the use of mathematical formalism in Generative Linguistics?

* mathematics is a powerful explanatory tool, because it is concise and flexible
* this is why it is the language of science (or as Galileo had it, the language in which the universe is written)
* it allows you to recognize when similar fundamental structures arise in different contexts: those are a sign of _universal laws of nature_

The purpose of science is to obtain a concise conceptual explanation of natural phenomena, that should be testable, predictive, and essential (entia non sunt multiplicanda praeter necessitatem)

Generative linguistics aims at producing such models of the structure and functioning of language slide from talk by Matilde Marcolli, title: "Where is the explanatory power? Where is the understanding?"

* do LLMs disprove Generative Linguistics, as some claim?
... No: quite the opposite, as the generative process of syntax is robust enough to emerge in keys and queries from a probabilistic smear of semantic relatedness

* do LLMs dispense with the need for theoretical linguistics?
... No: successes of LLMs as language-handling machines do not provide us with a fundamental, coincise, explanatory, conceptual understanding of the structure of language

* can LLMs be useful to theoretical linguistics?
.... Possibly, as an experimental apparatus for the investigation of inverse problems in the syntax-semantics interface

* if we have a functioning technology, do we need science?
031
Reposted by Noam Zeilberger
Tom de Jong @de-jong-tom.mathstodon.xyz.ap.brid.gy · 20/12/2024
I'm pleased to announce that the Heyting Day will be held in Amsterdam on Friday 14 March 2025. Its theme will be models of #intuitionism and #computability and mark the retirement of Jaap van Oosten. The invited speakers are: - @andrejbauer (Ljubljana) - […] [Original post on mathstodon.xyz]
134