I wanted to write a prime generator, but all the popular languages already have optimised ones I can't compete with.
commented version: https://gist.github.com/olligobber/0445a1721eb22b1d5b65bb4d4becdbf6
Wat. "There's an algorithm which solves SAT instances in polynomial time, if and only if P=NP. If P=NP, then it runs in polynomial time. If P is not equal to NP, it runs in the best possible non-polynomial time for such a solver." https://steemit.com/steemstem/@markgritter/leonid-levin-s-universal-algorithm
Fun project idea, a bot that responds to @logicbot with proofs of its tautologies.
This is a damn sexy font https://github.com/tonsky/FiraCode
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
Mathematician and design enthusiast. Computing, music, science, video games and art.
The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!