Comments by "Lawrence D’Oliveiro" (@lawrencedoliveiro9104) on "Pebbling a Chessboard - Numberphile" video.

  1. I can think of something worse: infinitely many mimes.
    4
  2. Yes it is. Because reductio ad absurdum (look it up).
    1
  3. 3:02 If all the possible moves are recursively enumerable, then it is still possible to conduct an exhaustive search to any given finite depth. That won’t be enough to prove impossibility, but it could still find a solution if one exists, at least not too far along.
    1