bogus comments on Eliezer's Sequences and Mainstream Academia - Less Wrong

99 Post author: lukeprog 15 September 2012 12:32AM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Comments (153)

You are viewing a single comment's thread. Show more comments above.

Comment author: Peterdjones 21 September 2012 12:55:41PM *  3 points [-]

(Edit)

Downvoted for being atleast twenty times more long-winded than necessary, and still failing to describe what a "free will" without determinism would look like.

Hmmm. Well, that's in the full lenght version of which this is an extract. I notice that EYs disquisition, which is problably longer, doesn't suffer from the problem of being "too long".

Pseudo-random, but I'll let that trivial point slide

Which instance of "random" do you think should have been pseudo random? Note that there are devices commercially marketed as supplying "real" randomness based on quantum physics.

The more significant point is that those random numbers are utterly meaningless in themselves -- the meaning and worth of a program lies in those aspects that are not random,

Says who? Are you saying that the use of randomisation in software is always a misttake, that programmers who feel it is necessary are just incompetent?

that pseudo-randomness is only meaningful in how it's deterministically used.

It is true that a random number is no good in itself, but equally you can't solve every problem with pure determinism. So the value of a deterministic+random algorithm is in its determinsm+randomness.

Comment author: ArisKatsaris 21 September 2012 01:55:00PM -1 points [-]

Which instance of "random" do you think should have been pseudo random?

The instance I quoted. But as I said the point is trivial.

Are you saying that the use of randomisation in software is always a misttake

I don't think I used the word "mistake", at all. I didn't even imply that it's sometimes a mistake, let alone always.

It is true that a random number is no good in itself, but equally you can't solve every problem with pure determinism.

Please name three problems you can't solve with determinism but you can solve with random-number generators. Besides encryption which depends on secrecy and therefore depends on not knowing what will come out, I can't think of any.

Comment author: bogus 21 September 2012 02:34:43PM *  5 points [-]

Since quantum algorithms are inherently random, these three problems qualify:

  1. Solve the Deutsch-Jozsa problem in constant time.
  2. Search an unstructured database in O(sqrt(n)) time.
  3. Factorize integers in polynomial time.

Moreover, randomized algorithms are occasionally useful in a classical computer, since they give good expected performance even for some classes of degenerate inputs.