enedil

25 ms·

241.
by enedil 8y ago
Your explanation is worse, since it doesn't allow to distinguish different infinities.
242.
by enedil 8y ago
Now you're conflating two different notions. You're (and your quotes) are talking about the first bullet point from the article. In turn, when taking about the last one, the one chosen by article author, from my experience, I&#x27
243.
by enedil 8y ago
The key point here is that you shouldn't be thinking of counting as a process that happens in time. How is infinity (here, omega) defined? We just say that it comes after any other natural number. So how to think about it? You shouldn&
244.
by enedil 8y ago
If there's someone exceptional, there are often numerous stipends.
245.
by enedil 8y ago
Because it's algorithm and not code.
246.
by enedil 8y ago
Repost: https://news.ycombinator.com/item?id=9698870
247.
by enedil 8y ago
It was expected that activist groups will say that these two companies are breaking GDPR, it is not so obvious that they will be actually fined (as the requests need to be processed by specific institution and might be found unwarranted).
248.
by enedil 8y ago
It's a really old debate. If I understand correctly what law is, I would say that lawmakers make some laws to express what is moral and what's not (according to them), but not always it's true that our moral standards are com
249.
by enedil 8y ago
So you're proposing distributed radix tree?
250.
by enedil 8y ago
That's exactly the point of parent comment.
251.
by enedil 8y ago
Fast primality testing is of course important from asymmetric crypto. Without it, we couldn't generate big semiprimes.
252.
by enedil 8y ago
No, very far from it
253.
by enedil 8y ago
We already have quick algorithms that say "is it prime" with certainty. Reducing the required time from O(log^6(n)) to O(1) isn't particularly important from cryptographic point of view. https://en.wikipedia.org&#x
254.
by enedil 8y ago
From my POV, he definitely positioned himself as someone that doesn't give a damn about user privacy
255.
by enedil 8y ago
Perhaps having legitimate purpose for data collection in the first place helps.
256.
by enedil 8y ago
A friend of mine from Lviv tells me that Ukrainian language is closer in structure and vocabulary to Polish than to Russian. I can't really assess this information, as I speak only Polish, from these three.
257.
by enedil 8y ago
So is it actually O(n^2)? Because that is a solution that can be implemented.
258.
Kendrick Lamar wins Pulitzer prize in music(mobile.twitter.com)
2 points by enedil 8y ago|0 comments
259.
by enedil 9y ago
What distribution are you on? My latest (!) stable Fedora still points at py2: ~ $ ls -als /usr/bin/python 0 lrwxrwxrwx. 1 root root 7 Mar 14 14:36 /usr/bin/python -> python2*
260.
by enedil 9y ago
Yes, I do it too - I have ublock orogin, privacy badger and httpseverywhere. I do it because the web is faster without ads and trackers. Just look at devtools and see how much time is saved by blocking requests.
261.
by enedil 9y ago
Whining about Comcast might be actually valid, but for most people of this world it's largely irrelevant. People from every place have Facebook access. Comcast customers are minority - Americans are minority. That's why Facebook h
262.
by enedil 9y ago
The descriptions are utterly useless. Instead of giving short account of capabilities, we're faced with advertisment.
263.
by enedil 9y ago
I suspect that computing Fibonacci numbers with Binet formula is slower than with matrix form - if mul(n) is the number of multiplications required to compute x^n, then matrix form will use 8 * mul(n) integer multiplications, while Binet&#x
264.
by enedil 9y ago
Unfortunate, that your results for `n = 90` are completely useless, since F_90 > 2^32 which is the size of int. Also, you could have shown a method which is O(log n), namely [[F(n+1) F(n)], [F(n) F(n-1)]] equals [[1, 1] [1, 0]] raise
265.
by enedil 9y ago
What other library tells you about complexity? And as you tell, if you don't know algorithns well, I'm pretty sure your implementations won't have better complexity.
266.
by enedil 9y ago
Look at any computer algebra system, for exaple sympy ( https://sympy.org ) and see how they implement it (it's open source).
267.
by enedil 9y ago
For every rational, there are infinitely many rational numbers too, since finite cartesian product of countable sets is countable.
268.
by enedil 9y ago
I frequently use Ctrl-tab or ctrl-shift-tab more than once at a time. It makes sense to preheat tab for a while after first usage of this shortcut.
269.
by enedil 9y ago
I wonder why when people are talking about some math discoveries, there's always someone who'll mention that truly marvellous proof by Fermat (or at least his Last Theorem). That has become repetitive and quite often without a lin
270.
by enedil 9y ago
If you write it and it doesn't finish in a minute, I'm sure it's not that trick.

More ›