Viewing profile — primecommenter
primecommenter
HN member- Joined
- Tue, Dec 27, 2011, 11:53 PM UTC
- HN karma
- 58
- Public activity
- 23 items
- HN profile
- View on Hacker News ↗
About primecommenter
No profile information was provided.
Recent public activity
-
comment
Comment #3976284
Coding doesn't necessarily involve time deadlines, and maybe cooking doesn't either, although it seems to. I agree with the rest of what you said though.
-
comment
Comment #3976262
Rule 11213: First person to mention "time" when linked article does not include the term "time" takes 1 step backward, 1 step forward, 2 steps backward, 1 step forward, 3 steps bac…
-
comment
Comment #3976176
Both are life skills and that is the context.
-
comment
Comment #3976113
"If the mayor of NYC wants to learn to program in his spare time, why the hell not?" I agree totally, not only would it be good for him but it sets a good example for his constitue…
-
comment
Comment #3976012
I'm not trying to be facetious, just misunderstanding whatever point original commenter is making. "Most people don't what programming even looks like"? I don't think that is true …
-
comment
Comment #3975984
... and then profess to study that which his generational peers have foregone. If only we could all be mayors of NYC!
-
comment
Comment #3975924
Indeed, why not? This is no more or less as exciting an announcement as that of a new knitting hobby.
-
comment
Comment #3975906
As opposed to a professional "coder"? (I also see "programmer" as a more distinguished title and I prefer it to "coder" (and even "software engineer"), but I don't understand any o…
-
comment
Comment #3975840
I don't understand the distinction you raise in the first paragraph. Coding is programming. Just because everyone can divide doesn't mean everyone is trying to be a mathematician, …
-
comment
Comment #3975818
Most of us use most of a lifetime of knowledge in our day jobs, and machines are magical.
-
comment
Comment #3975764
"Can you explain to me how Michael Bloomberg would be better at his day to day job of leading the largest city in the USA if he woke up one morning as a crack Java coder?" If anyth…
-
comment
Comment #3975617
... who, according to the story, asked why, expressing approval and amusement, but not surprise.
-
comment
Comment #3974135
This is nonsense. It's absurd for you to argue that the difficulty of writing "Hello world" on an Apple device is somehow a good thing for Apple or anyone else on the basis of a wi…
-
comment
Comment #3892856
I don't see the connection. Is Go even bootstrapped?
-
comment
Comment #3826507
It is possible to find the median in linear time (quickselect). Pivoting on the median makes quicksort optimal (O(n log(n))) while only using constant space. This is rarely used in…
-
comment
Comment #3655776
Doubly-homomorphic encryption (also called "fully-homomorphic") was recently invented and in principle solves the general problem.
-
comment
Comment #3606266
It is already reduced to the initial handshake. That is exactly what a CA does. But perhaps you are right that a CA should sign certificates based on influence-weighted pseudonymou…
-
comment
Comment #3595852
"We did this by computing the greatest common divisor (GCD) of all pairs of moduli from RSA public keys on the Internet." For your key to be safe from this method, all you need to …
-
comment
Comment #3517312
I particularly like the example of Literate Roy: https://github.com/pufuwozu/roy/blob/master/examples/sqrt.lr... . This example demonstrates some of the language features and synta…
-
comment
Comment #3516839
How does equating rationality with profit-maximization further this discussion in any meaningful way?
-
comment
Comment #3398584
Even more remarkable is that they build directly upon the 400-year-old method of Fermat ( http://en.wikipedia.org/wiki/Fermat%27s_factorization_method ).
-
comment
Comment #3398109
If p^2+p+1 is smooth or if p^2+1 is smooth then n can be factored with cyclotomic methods. http://www.ams.org/journals/mcom/1989-52-185/S0025-5718-1989...
-
comment
Comment #3397986
While perhaps not an advance, the algorithms implemented are state-of-the-art (GNFS, Pollard's p-1 test, Williams' p+1 test, cyclotomic polynomial test). But whatever the running t…