alxv

28 ms·

31.
by alxv 14y ago
Well, they are probabilistic machines then! ;-)
32.
by alxv 14y ago
Managing a company is not that different from coding: instead of instructing machines what to do, you instruct people.
33.
by alxv 15y ago
Well, there is a Cont monad in Haskell (Control.Monad.Cont). I am not too familiar with it though I know there is a good chapter about it in the Haskell Wikibook ( http://en.wikibooks.org/wiki/Haskell/Continuation_passing_st... ).
34.
by alxv 15y ago
Internationalization issues could explain the change from a word based navigational to an icon based one. Long words from languages other than English might not fit well in the new layout.
35.
by alxv 15y ago
There is an official Chrome extension for RSS: https://chrome.google.com/webstore/detail/nlbjncdgjeocebhnmk... I have no idea why it is not part of the default install though.
36.
by alxv 15y ago
I have got the same feeling. It is this idea of moving away from the pencil-and-paper operating system for modeling complex systems. Victor is more about making computing explorable and accessible to the masses, whereas Sussman is more abou
37.
by alxv 15y ago
Yes, Golub/van Loan is the bible. But Walkins's "Fundamentals of Matrix Computations" ( http://www.amazon.com/o/asin/0470528338/ ) is much more accessible to self-learners. For those who are just starting on this subject, I highly recommend
38.
by alxv 15y ago
The Disconnect extension for Chrome is pretty good for that: https://chrome.google.com/webstore/detail/jeoacafpbcihiomhla...
39.
by alxv 15y ago
It seems a variation of this well-known illusion: http://kids.niehs.nih.gov/images/illusions/pinkdots.gif
40.
by alxv 15y ago
I don't think he is a Google employee. He is a Google aficionado perhaps, but likely not an employee.
41.
by alxv 15y ago
Even Eric Schmidt would go on and on about how "literal" Googlers take everything, how stereotypically engineer-minded they are, basically implying they were incapable of being creative or having vision or social skills. Do you realize th
42.
by alxv 16y ago
The name "Konqueror" is a reference to the two primary competitors at the time of the browser's first release: "first comes the Navigator, then Explorer, and then the Konqueror" -- From Wikipedia, http://en.wikipedia.org/wiki/Konqueror
43.
by alxv 16y ago
Uh, what!?
44.
by alxv 16y ago
What it means to be "faster"? Is it having a higher I/O throughput? Or, is it having a lower latency on the 95th or 98th percentile? Also, the slides give little information about scalability of the two models. From what I know, the perform
45.
by alxv 17y ago
According to the Unladen Swallow's team [1], LLVM's "just-in-time infrastructure was relatively untested and buggy" when they started working with it. So, I think not using LLVM was a pragmatic decision. In addition, debugging C++ code is m
46.
by alxv 17y ago
Functional programmer: import operator def factorial(n): return reduce(operator.mul, xrange(1, n+1), 1) print factorial(6) Cutting-edge programmer: import math print(math.factorial(6))
47.
by alxv 17y ago
A custom daemon would be great, but meanwhile you could use inotify-tools from the shell: while inotifywait -r -e modify . do git wip save "automatic save" done
48.
by alxv 17y ago
Not useful for me. I would prefer to use the command-line over your service, if I wanted to know the server running a site. beewulf() { curl -s -I $1 | grep Server: }
49.
by alxv 17y ago
Indeed! http://blogs.azulsystems.com/cliff/2008/11/a-brief-conversat...
50.
by alxv 17y ago
The dictionary implementation of Python is a hash table using open addressing with quadratic probing. Deletion is essentially a lookup to replace the key with a tombstone. And, the table is never resized after a deletion. So yes, the whole
51.
by alxv 17y ago
I am not sure why you think deletion has to be O(log n), but can assure you that it is O(1). Of course, this is assuming you consider a hash table lookup to take constant time. If that can help, this is implementation of deletion for the Or
52.
by alxv 17y ago
The cited benchmark is completely bogus. The benchmark compares the different implementations based a single trivial regular expression: /indecipherable|undecipherable/. You simply cannot claim a regex engine is faster than another with suc
53.
by alxv 17y ago
But that tells us nothing about the quality of Erlang's Unicode support. Is it easy in Erlang to encode a string to its UTF-8 or Latin-1 representation and vice-versa? Are there utilities in Erlang to check whether a character is a punctuat
54.
by alxv 17y ago
Conversely, automatic indentation requires syntactic analysis.
55.
by alxv 17y ago
But to an observer, a "longer" meter is sill a meter.
56.
by alxv 17y ago
> I would also suggest picking up a Number Theory or Combinatorics text; they're practically useless Useless? I dear to say that number theory is currently the most lucrative field of mathematics. Without number theory, modern day crypt
57.
Twitter reschedules downtime in response to Iran situation(blog.twitter.com)
2 points by alxv 17y ago|0 comments
58.
by alxv 17y ago
In "The Practice of Programming", Brian Kernighan and Rob Pike use the Markov Chain Algorithm to illustrate a number of lessons about software design and implementation. I used it as my "Hello world" program when learning a new programming
59.
by alxv 17y ago
Richard Stevens's "Advanced Programming in the UNIX Environment" has a chapter dedicated to how to write well-behaved daemons. The book is a great investment if you are doing any kind of UNIX programming; I highly recommend it.
60.
by alxv 18y ago
This is futile, since they can keep previous versions of your data. In fact, this is stated explicitly in Facebook's privacy policy: "When you update information, we usually keep a backup copy of the prior version for a reasonable period of

More ›