nayuki

183 ms·

2071.
by nayuki 11y ago
The article is mostly good, but I have one nitpick. > An example of an O(2^N) function is the recursive calculation of Fibonacci numbers No, the naive recursive evaluation of the Fibonacci sequence has complexity O(1.618^N) (or just O(Fi
2072.
by nayuki 11y ago
Just how big is the entire world map in this game? There seems to be no end in sight when I move around the mini-map...
2073.
by nayuki 11y ago
Darn it - I was going to assume they chose to name the project after myself =)
2074.
by nayuki 11y ago
What advantage does this technique have over measuring radioactive atoms?
2075.
by nayuki 11y ago
This web page is pretty image-heavy though. Lazy loading optimizes for the reader who reads partway through and abandons reading the rest of the page.
2076.
by nayuki 11y ago
Starting from this page: http://www.bertolami.com/index.php , I noticed that many links are implemented in JavaScript and do not support middle-clicking.
2077.
by nayuki 11y ago
Did you mean to write "aren't"?
2078.
by nayuki 11y ago
Even today there are some minority 32-bit products around in the PC world where the Oracle Java VM can run. For example the HP Stream 7 tablet runs Windows 8.1 32-bit edition on x86 Intel Atom Z3735G (CPU is x86-64 capable). It can only sup
2079.
by nayuki 12y ago
I found the title to be misleading. I thought it referred to the use of quantum computing to break public key cryptography and inject data. But instead, it's just some dumb TCP man-in-the-middle spoofing, only a bit more sophisticated
2080.
by nayuki 12y ago
Regarding the computation of a single term: No, the well-known Binet formula involving phi is unsuitable because it uses real numbers. See these detailed comments about handling quadratic surds properly, which is effectively the same as the
2081.
by nayuki 12y ago
Agreed, this response is exactly correct. I didn't realize that my wording of "slow recursion" could be misread as "every recursion is slow", which is not true - especially because every iterative procedure can be e
2082.
by nayuki 12y ago
It would be incomparable because the 4 algorithms described on the page produce exact integer results, whereas a floating-point algorithm will not have enough precision to represent larger numbers.
2083.
by nayuki 12y ago
There was an interesting data synthesis piece of music this week: https://vimeo.com/122603843 "Air Play - Smog Music Created With Beijing Air Quality Data"
2084.
NASA - The Tyranny of the Rocket Equation(nasa.gov)
3 points by nayuki 14y ago|0 comments
2085.
by nayuki 14y ago
Very nice article, luckytoilet! I recently published my own minesweeper AI, and it does only a subset of what your program does. The explanations in your article would be applicable to my work too. My program plays the pre-Vista/7 version o
2086.
A septillion CPU cycles a year(nayuki.eigenstate.org)
1 points by nayuki 15y ago|0 comments
2087.
Chemical equation balancer (JavaScript)(nayuki.eigenstate.org)
2 points by nayuki 15y ago|0 comments