ianopolous

46 ms·

391.
by ianopolous 12y ago
I also wrote a blog post about these numbers recently. http://ianopolous.github.io/maths/surreal/
392.
by ianopolous 12y ago
I actually tried this for fun during my PhD I made sure the program instruction set was Turing complete and ran it along Koza's lines. As predicted, it took too long. On any reasonable time scale, the best evolved program was to play r
393.
by ianopolous 12y ago
Oxford (UK), Local|Remote| May be willing to relocate (Australia/UK dual citizen), Full Time Stack: Java, Scala, x86 Resume: http://content.wuala.com/contents/ianopolous/public/cv.pdf Contact: ian [dot]
394.
by ianopolous 12y ago
This is a good book, though a few years old now: Beautiful Architecture: Leading Thinkers Reveal the Hidden Beauty in Software Design ( http://shop.oreilly.com/product/9780596517984.do ) Disclaimer: I'm the lead de
395.
by ianopolous 13y ago
The DAG of concepts is brilliant. I've manually made my own DAG for interesting branches of mathematics over the years and used it as a guide for self study. This could be big for education.
396.
by ianopolous 13y ago
I do everything these days in a VM, Virtualbox at the moment. A different VM for different classes of task. With the shared clipboard and shared folder options it is still pretty convenient. Of course, my laptop has 16gb of ram which helps
397.
by ianopolous 13y ago
It was fiendish, but when I reached it there seemed no reason (apart from the game ending) that 4096 couldn't be reached.
398.
by ianopolous 13y ago
I would expect that to make it easier, although there may be a parity effect of a 4x4. It just seemed arbitrary to stop at 2048 (and I'll increase it if anyone beats it until it becomes impossible). Proofs of impossibility welcome. :-
399.
4096(ianopolous.github.io)
3 points by ianopolous 13y ago|5 comments
400.
Former director of the NSA and CIA is speaking at Oxford University.
1 points by ianopolous 13y ago|0 comments