LukasM

• LukasM 27 Jul 2024 9:49 UTC

  2 points

  0

  on: Or­gani­sa­tion for Pro­gram Equil­ibrium read­ing group

  Hey, I would love to go, but only if it’s in-person.

  My personal experience is that trying to understand something in a group works a lot better in-person, plus I’d like to get to know more people in London.

• LukasM 5 Sep 2019 20:20 UTC

  LW: 4 AF: 3

  AF

  in reply to: Daniel Kokotajlo’s comment on: Al­gorith­mic Similarity

  Thanks a lot for the link. I’ll put it in the reading list (if you don’t mind).

  I would be interested to hear what you think about the more technical version of the problem. Do you also think that that can have no good solution, or do you think that a solution just won’t have the nice philosophical consequences?

  Also, I’m excited to know a smart waterfall apologist and if you’re up for it I would really like to talk more with you about the argument in your thesis when I have thought about it a bit more.

• LukasM 5 Sep 2019 20:10 UTC

  LW: 1 AF: 1

  AF

  in reply to: Vanessa Kosoy’s comment on: Al­gorith­mic Similarity

  I definitely think the computational complexity approach is worth looking into, though I think computational complexity behaves kind of weirdly at low complexities.

  I like the view that waterfalls are at least a bit conscious! Definitely goes against my own intuition.

  I’m a bit worried that whether or not there is a low description complexity and low computational complexity algorithm that decodes a human from a waterfall might depend heavily on how we encode the waterfall as a mathematical object and that although it would be clear for “natural” encodings that it was unlike a human we might need a theory to tell us which encodings are natural and which are not.

• LukasM 26 Aug 2019 8:24 UTC

  LW: 1 AF: 1

  AF

  in reply to: Charlie Steiner’s comment on: Al­gorith­mic Similarity

  Thank you!

  I hadn’t thought about Rice’s Theorem in this context before but it makes a lot of sense.

  I guess I would say that Rice’s Theorem tells us that you can’t computably categorize Turing machines based on the functions they describe, but since algorithmic similarity calls for a much finer classification I don’t immediately see how it would apply.

  And even if we had an impossibility result of this kind, I don’t think it would actually be a deal breaker, since we don’t need the classification to be computable in general to be enlightening.

• LukasM 23 Aug 2019 17:49 UTC

  LW: 2 AF: 2

  AF

  on: Thoughts from a Two Boxer

  I’m going to post this anyway since its blog-day and not important-quality-writing day but I’m not sure this blog has much of a purpose anymore.

  I liked the characterization of decision theory and the comment that the problem naively seems trivial from this perspective. Also liked the description of Newcomb’s problem as a version of the prisoners dilemma. So it totally had a purpose!

• LukasM 23 Aug 2019 17:41 UTC

  LW: 2 AF: 2

  AF

  on: Thoughts from a Two Boxer

  I have already stated I see the third bullet as an unfair problem.

  Should this be “the first bullet”?

Al­gorith­mic Similarity