chpatrick

136 ms·

1111.
by chpatrick 11y ago
Something very similar for Haskell, as a library: http://leventerkok.github.io/sbv/
1112.
by chpatrick 11y ago
You can turn it into an SMT problem and solve it with a standard solver. In Haskell it's quite beautiful as you can write code that's basically identical to writing a parser, and then generate inputs that satisfy the parser magica
1113.
by chpatrick 11y ago
Well, it would also be very strange if P=NP because you could use algorithms like this in polynomial time: bool isComposite(n) { guess a number d magically if (n % d == 0) { return true; } else { fail; } }
1114.
by chpatrick 12y ago
I used Slackware, Gentoo and Arch for ten years but in the end I'm on Ubuntu. I liked feeling in control on those systems and it was great to have everything available immediately on Portage or AUR, but after a while I just got tired o
1115.
Microsoft apps will be bundled on Cyanogen Android devices(engadget.com)
1 points by chpatrick 12y ago|0 comments
1116.
by chpatrick 12y ago
At my University (Imperial College London), our operating systems coursework was built around a toy OS called Pintos ( http://en.wikipedia.org/wiki/Pintos ), which is written in assembly and C and runs on x86. The projec
1117.
by chpatrick 12y ago
One of my lecturers at Imperial College called it the most beautiful unknown algorithm. :)
1118.
by chpatrick 12y ago
I'm not sure you could do that with a monad. They still let you use whatever pure function you want, which can have arbitrary complexity.
1119.
by chpatrick 12y ago
I'm disagreeing with this statement: "You definitely need to use unsafe Haskell code in order to implement most cryptographic primitives in a way making them resistant to timing attacks." Safe indexing is constant time too, u
1120.
by chpatrick 12y ago
Why isn't it possible? The safe versions just do bounds checking, which still seems constant time to me. If you mean that somewhere in the stack something must do pointer math you're right, but that's a given whatever you do
1121.
by chpatrick 12y ago
Sure, but the point is that you can get some pretty nice speeds without writing any C yourself.
1122.
by chpatrick 12y ago
It's 1.08s on my computer for one line of Python, which is respectable: python2 -m timeit -v -n 1 -s "import numpy" "numpy.memmap('1_gb_file', mode='r').sum()"
1123.
by chpatrick 12y ago
It's everywhere in Budapest: http://www.clubmate.hu/#map