In these days in which "exponential growth" has such ominous connotations, we are pleased to announce our new paper which includes fast-growing functions in a much lighter setting. Fusible numbers and Peano Arithmetic. . Joint work with @jeffgerickson and @alreadydone

For the first time in history, the EuroCG workshop is being held in online-only format. Here is my talk:

@11011110 @jeffgerickson @alreadydone M(3) = 2^-1541023937. But Python should be able to get to something like M(3 - 2^-5)

Consider the algorithm "M(x): if x<0 return -x, else return M(x-M(x-1))/2". This algorithm terminates for all real x, though this is not so easy to prove. In fact, Peano Arithmetic cannot prove the statement "M(x) terminates for all natural x". Paper to come! Joint work with @jeffgerickson and @alreadydone

@bremner Me, a Mathematica user for decades: Why yes, (#^%%)! & /@ %%% seems like a perfectly reasonable thing to write, why do you ask?

@11011110 Very impressive! They mention casually in the abstract that P=NP

@11011110 Right. There are many other difficulties. Even for the ACSF itself, existence and uniqueness of the flow past singularities has not been proved, only for the CSF.

@11011110 How many types of "x" can you count in the statement of this lemma? (The identity of the authors is kept confidential)

@11011110 I wonder if every such number can be written as the sum of three cubes in *infinitely many ways*.


The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!