Prove that for every n, every polygon (even if it has holes) can be partitioned into n connected pieces of the same area

BTW that still-life he smashes the glider at, at 3:14 in the video, is mine😀

Show thread

Derek Muller's latest Veritasium video is simply amazing! In half an hour he accurately explains Cantor, Gödel, and Turing, with beautiful animations. All the more amazing given that his original background is physics

Tomorrow I'll be talking about fusible numbers and Peano Arithmetic at the Steklov Math Institute's logic seminar, in Moscow. Via Zoom

Exit strategy idea that might beat the coronavirus: Make people alternate between one week of activity and one week of lockdown. That way, most infected people will become infectious when they're in lockdown.

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:

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?


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