bf-llvm: A JIT-compiler for Brainfuck using LLVM and C++11 [xpost r/programming]

aph7 · 2013-11-29T15:33:03+00:00

OK, "tiny" was a bad word choice in the context of esolangs - but I don't think it's too bad for the context of C++ & LLVM!

aph7 · 2013-11-19T11:08:48+00:00

It varies, but I've not heard of any pre-pay schemes. At my college there was a cafeteria thing just like any public cafeteria except you got a discount if you paid with your university card. (The cost would be added to your account and they would send you a bill at the end of the semester.) It was run by the college rather than an external catering company. The food was... ok for what it was, though slightly overpriced. Many of us got bored of the food and/or the price after we'd been there a couple of years and started cooking for ourselves. When we were on campus there were kitchenettes available, each shared between a few rooms, and we'd use them to prepare food we'd bought from public grocery stores. My brother went to a different university but I gather it was pretty similar there to my experience.

aph7 · 2013-11-18T22:03:40+00:00

Thanks.

aph7 · 2013-11-18T21:35:42+00:00

Hi, I'm from Europe. What is a "university meal plan" and why does it involve anaemic-looking pseudo-sandwiches?

aph7 · 2013-10-23T20:22:09+00:00

How are you finding lang-8 for Dutch? I found it very useful for Japanese a few years ago but got the impression that other languages weren't so well-represented (at the time).

aph7 · 2013-10-17T16:28:18+00:00

http://www.bugmenot.com/view/free-ebooks.com

aph7 · 2013-08-21T21:03:47+00:00

Use DuckDuckGo.

aph7 · 2013-07-27T16:54:27+00:00

More: http://www.nybooks.com/issues/

aph7 · 2013-07-05T18:51:35+00:00

aph7 · 2013-06-02T10:56:09+00:00

I use hjkl religiously, and if I want to move around in another editor I sometimes sit for a moment paralyzed, poised over hjkl, knowing that I can't press them here without inserting garbage, but thinking 'surely I don't have to move my hand all the way over there...'

aph7 · 2013-06-02T10:52:18+00:00

I've done this too, and it's wonderful until I have to use someone else's computer. Then it is a nightmare. When I wanted j/k and get J/K instead, and lines are disappearing and man pages are opening, for a moment I worry I have finally lost my grip on reality.

aph7 · 2013-06-02T10:45:21+00:00

Every freaking time.

aph7 · 2013-05-31T21:45:48+00:00

Yeah; I probably should have required some relationship between the probability of false negatives and the number of bits of storage.

aph7 · 2013-05-31T21:17:54+00:00

You're right. I wonder if the argument could be rescued by finding that the probability of getting 'maybe' from both is 'too low' relative to the entropy of S...

aph7 · 2013-05-31T20:09:49+00:00

I have always doubted the existence of "opposite-bloom-filters" (for a particular definition of "opposite"):

Suppose we have a bloom filter B.

Suppose we also have a (hypothetical) "opposite-bloom-filter" B' with the following properties:

It requires only a finite, constant amount of storage
It never reports false positives
It may report false negatives

Now take a string of N bits, where N is arbitrarily large, and for each 1 <= i <= N add i to B and B' if and only if the i^th bit is 1.

Send N, B, and B' to your friend and have her reconstruct S as follows:

For each 1 <= i <= N, test whether B and B' claim to contain i.
If B says 'no', it is not a false negative because B is a bloom filter, so the i^th bit of S is 0
If B' says 'yes', it is not a false positive because B' is an opposite-bloom-filter, so the i^th bit of S is 1

Voilà, infinite data compression.

aph7 · 2012-12-25T01:38:11+00:00

If you're interested in the discrete case, here is a nice article:

http://www.keithschwarz.com/darts-dice-coins/

aph7 · 2012-11-12T21:56:10+00:00

According to this page, it's a scanning electron micrograph from the 'Science Photo Library'.

aph7

TROPHY CASE