Name: Mauro Persano
Member since: 2005-03-31 16:27:10
Last Login: 2008-05-15 01:23:14
Homepage: http://www.fzort.org/mpr/
Notes: Mostly self-taught programmer living in São Paulo, Brazil. Corporate code monkey by day, wannabe free software hacker by night. By the way, English is not my first language (such a convenient excuse). Contact: m (at) fzort (dot) org
2 May 2008 (updated 3 May 2008 at 01:43 UTC) »
I'm pretty excited. Needless to say, I've been following the tech news with utmost interest.
There is in Aristotle an almost complete absence of what may be called benevolence or philanthropy. The sufferings of mankind, in so far as he is aware of them, do not move him emotionally; he holds them intellectually to be an evil, but there is no evidence that they cause him unhappiness except when the sufferers happen to be his friends.
22 Apr 2008 (updated 22 Apr 2008 at 11:09 UTC) »
Abstract. This paper presents some simple ideas about domino gates. Domino gates are implementations of logical operations using toppling dominos to represent the movement of information (bits). (...) The domino model can be used as a representation of single-shot wave gates in unconstrained media, such as sub-excitable Belousov-Zhabotinsky reactors. On a practical note, they are slightly easier to set up and use than collision models using 'billiard balls'.
More at the International Center of Unconventional Computing.
18 Apr 2008 (updated 18 Apr 2008 at 22:52 UTC) »
Anyway, I skipped lunch and instead worked a bit on this problem. After much head scratching, came up with a O (N^2*M) dynamic programming solution (with N the length of the sequence and M the size of the alphabet). Was really proud of myself for about 3 minutes, until I noticed that N can be as large as 100000. Boom. Anyway, my worthless non- solution is here (sorry, in Java - as I said, I did it at work). Space can be reduced to just O(N*M), but that doesn't help with time.
laburu: I'll get around to answering your e-mail eventually, I swear.
17 Apr 2008 (updated 17 Apr 2008 at 16:31 UTC) »
Ah well. Lunch break, and I've just solved this problem. It requires more insight than code, so I could work on it for the past couple of days while in the train, in the bathroom, etc. The resulting program is small and simple, but I had to deploy some hardcore permutation group theory to arrive at the solution. I wonder if there's a simple "Aha!" insight that I'm missing. If you think there is, I'd really love to hear.
fzort certified others as follows:
Others have certified fzort as follows:
[ Certification disabled because you're not logged in. ]
FOAF updates: Trust rankings are now exported, making the data available to other users and websites. An external FOAF URI has been added, allowing users to link to an additional FOAF file.
Keep up with the latest Advogato features by reading the Advogato status blog.
If you're a C programmer with some spare time, take a look at the mod_virgule project page and help us with one of the tasks on the ToDo list!