3,574 followers
@sigfig PDEs, or even just ODEs, are expressive enough to simulate Turing machines. [1] There's no hope in figuring them out. 😔 [1] https://t.co/ooSW6AaCW2
@sigfig PDEs, or even just ODEs, are expressive enough to simulate Turing machines. [1] There's no hope in figuring them out. 😔 [1] https://t.co/ooSW6AaCW2
@XenaProject @codydroux @andrejbauer Barr's theorem: "every proof (in ZFC) of a geometric statement also has a constructive proof." https://t.co/vRwDYHkRjJ This is the point of pointless topology, or Hilbert program: https://t.co/XX5n9QJF3n https://t.co/pC