Difference between revisions of "Talk:1516: Win by Induction"
Line 6: | Line 6: | ||
"infinite, but countable" {Cough.} Someone doesn't understand infinity. Perhaps they meant "enumerable". [[Special:Contributions/108.162.250.155|108.162.250.155]] 09:29, 24 April 2015 (UTC) | "infinite, but countable" {Cough.} Someone doesn't understand infinity. Perhaps they meant "enumerable". [[Special:Contributions/108.162.250.155|108.162.250.155]] 09:29, 24 April 2015 (UTC) | ||
+ | :Someone doesn't understand countability. [[Special:Contributions/141.101.89.217|141.101.89.217]] 09:46, 24 April 2015 (UTC) | ||
"The front most Pikachu speaks." Hey, look, it has those little lines to show it's speaking, not the blank white space behind it. Duh. [[Special:Contributions/108.162.250.155|108.162.250.155]] 09:32, 24 April 2015 (UTC) | "The front most Pikachu speaks." Hey, look, it has those little lines to show it's speaking, not the blank white space behind it. Duh. [[Special:Contributions/108.162.250.155|108.162.250.155]] 09:32, 24 April 2015 (UTC) | ||
Looks like Megan is looking at her watch as well. Mention in transcript/explanation? [[User:Fenn|Fenn]] ([[User talk:Fenn|talk]]) 09:34, 24 April 2015 (UTC) | Looks like Megan is looking at her watch as well. Mention in transcript/explanation? [[User:Fenn|Fenn]] ([[User talk:Fenn|talk]]) 09:34, 24 April 2015 (UTC) |
Revision as of 09:46, 24 April 2015
Is the alt text a reference to double-yolkers (eggs with two yolks)? They're only about 1 in every 1000 but it seems like an obvious reference. --Fenn (talk) 08:32, 24 April 2015 (UTC)
- Makes sense to me. I didn't even think of double yolks until you mentioned it here. 173.245.50.89 09:04, 24 April 2015 (UTC)BK201
The explanation currently says that doubling makes it uncountably infinite. I'm pretty sure that doubling at each step (or every few steps) is still a countable infinite set. Proof here: http://practicaltypography.com/the-infinite-pixel-screen.html (see section "The internet demands a recount", because the first attempt is wrong). We can also prove it using the same argument as when proving that N x N is countable infinite (making zig-zag), but in this case making a breadth-first search of the tree of Pikachus: map 1 to the first Pikachu, map 2 and 3 to the two Pikachus at the second level, map 4, 5, 6, 7 to the four Pikachus at the third level, map (2^(n-1))…((2^n) - 1) to the 2^(n-1) Pikachus at level n. 108.162.229.177 (talk) (please sign your comments with ~~~~)
- Saw this too late. Yes, I agree, and I have fixed it accordingly. --Stephan Schulz (talk) 09:28, 24 April 2015 (UTC)
"infinite, but countable" {Cough.} Someone doesn't understand infinity. Perhaps they meant "enumerable". 108.162.250.155 09:29, 24 April 2015 (UTC)
- Someone doesn't understand countability. 141.101.89.217 09:46, 24 April 2015 (UTC)
"The front most Pikachu speaks." Hey, look, it has those little lines to show it's speaking, not the blank white space behind it. Duh. 108.162.250.155 09:32, 24 April 2015 (UTC)
Looks like Megan is looking at her watch as well. Mention in transcript/explanation? Fenn (talk) 09:34, 24 April 2015 (UTC)