Especially during test season.
While helping Aya study for a test, I stupidly agreed to install XP SP3 (offered by automatic updates). The nagging box asking me to restart kept appearing. During one of our study breaks, the box appeared, and having no one to tell it “No” for 5 minutes, it rebooted the computer.
When we came back, the computer was in a boot loop. Starting up in safe mode didn’t help, nor did “Last known configuration”. The solution was, oddly enough, to remove all USB devices! We used an old PS2 keyboard to run System Restore (God bless System Restore). The full solution might be here, I didn’t bother reading the rest of the thread right now.
Recommended for hardcore logicians only (or just people who like to think).
Löb’s Theorem apparently states that "if it is provable that ‘if X is provable, then X’, then X itself is provable". The cartoon helps you (just a bit) to avoid getting trapped in an endless loop of logic.
There’s also a bonus exercise at the end, quite refreshing.
Quick – go to your Gmail account –> Options –> Always Use HTTPS
And your future sessions with Gmail will be SSL secured.
(This came as a response to a tool that automatically breaks into Gmail accounts, and is a long time overdue IMO).
Update – Boaz claims his Avast anti virus detected a virus after following the link below. My AVG doesn’t detect anything, but follow at your own peril (you should be safe with Firefox & NoScript anyway)
A Blue Screen of Death project in the 2008 Olympics 🙂 (while Bill Gates was attending it)
Finally, after years of research, months of writing and correcting, and weeks of bureaucracy, I finished my M.Sc thesis!
Today I got a shocker.
I tried the not-too-complicated regular expression:
I worked in the excellent RegexBuddy, and ran the above regex on a normal size HTML page (the regex aims to find all links in a page). The regex hung, and I got the following message:
|The match attempt was aborted early because the regular expression is too complex.
The regex engine you plan to use it with may not be able to handle it at all and crash.
Look up "catastrophic backtracking" in the help file to learn how to avoid this situation.
I looked up “catastrophic backtracking”, and got that regexes such as “(x+x+)+y” are evil. Sure – but my regex does not contain nested repetition operations!
I then tried this regex on a short page, and it worked. This was another surprise, as I always thought most regex implementations are compiled, and then run in O(n) (I never took the time to learn all the regex flavors, I just assumed what I learned in the university was the general rule).
It turns out that one of the algorithms to implement regex uses backtracking, so a regex might work on a short string but fail on a larger one. It appears even simple expressions such as “(a|aa)*b” take exponential time in this implementation.
I looked around a bit, but failed to find a good description of the internal implementation of .NET’s regular expression engine.
BTW, the work-around I used here is modify the regex. It’s not exactly what I aimed for, but it’s close enough:
Well, aren’t we all? Go get your banner now.
Heh, I still remember the days when I only programmed in C++, and Tomer told me how great C# is (one of the major benefits he listed was Resharper 2.0).
I didn’t believe him then, but now, I don’t understand how anyone can program in C++ (except realtime/embedded programmers).
Well, everyone that’s told me in the recent week how good the new Batman movie couldn’t prepare me – it is really that good, and better.
I rate it 5 on movielens (must see).