olligoblin @olligobber@mathstodon.xyz

I made a regex to match all multiples of 7, but it was >10,000 characters so grep couldn't handle it.

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

From @frobunnius@twitter.com: Did you know?
bunnies’ large ears help (super)cool their powerful brains while they contemplate particularly difficult mathematics

Someone has challenged me to implement brainfk in universal iota...

@logicbot I mean, https://github.com/olligobber/DirectProof can almost generate the proofs, just need to add some conditional proofs of a→a etc. at the start, then figure out the I/O

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

I declare ln(69)≈4.234 to be Sanderson's number

Cat tax

I think I need to set up a cat bed next to me laptop's heat vent.

Found via @statebox@twitter.com

Functional Programming Meme

Via @scienceshitpost@twitter.com

Good old futurama...

Can't remember Cory Doctorow's name? Just google "xkcd cape guy"!