Editing Talk:1381: Margin
Please sign your posts with ~~~~ |
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 3: | Line 3: | ||
::Actually the proof of the Shannon-Hartley theorem is non-constructive. It tells you the data rate of the best possible channel coding, but does not tell you how to achieve it! [[Special:Contributions/108.162.215.47|108.162.215.47]] 07:58, 13 June 2014 (UTC) | ::Actually the proof of the Shannon-Hartley theorem is non-constructive. It tells you the data rate of the best possible channel coding, but does not tell you how to achieve it! [[Special:Contributions/108.162.215.47|108.162.215.47]] 07:58, 13 June 2014 (UTC) | ||
Setting font-size to 0 would be the same as not ''printing'' any information at all, you'll still use the same number of bits and be able to send the text to other computers which can read the information. The Shannon-Hartley theorem is, as far as I can see from the wikipedia article, about analogue channels anyway. --[[User:Buggz|Buggz]] ([[User talk:Buggz|talk]]) 06:16, 13 June 2014 (UTC) | Setting font-size to 0 would be the same as not ''printing'' any information at all, you'll still use the same number of bits and be able to send the text to other computers which can read the information. The Shannon-Hartley theorem is, as far as I can see from the wikipedia article, about analogue channels anyway. --[[User:Buggz|Buggz]] ([[User talk:Buggz|talk]]) 06:16, 13 June 2014 (UTC) | ||
− | |||
− | |||
Isn't this also a reference to {{w|Jan Sloot}}'s digital compression mechanism where a movie would fit into 8 kbyte? [[User:Kaa-ching|Kaa-ching]] ([[User talk:Kaa-ching|talk]]) 07:36, 13 June 2014 (UTC) | Isn't this also a reference to {{w|Jan Sloot}}'s digital compression mechanism where a movie would fit into 8 kbyte? [[User:Kaa-ching|Kaa-ching]] ([[User talk:Kaa-ching|talk]]) 07:36, 13 June 2014 (UTC) | ||
Line 13: | Line 11: | ||
Is the problem behind Fermat's Last Theorem "deceptively simple" or "deceptively difficult"? I've never quite worked out which way it should be. Unlike "cheap at half the price" which really should be "cheap at twice the price" and the effect of putting in the word "only" into "glass ... half full/empty". But I bet you all could care less (or, more accurately, "''couldn't'' care less", because you already do not care at all), right? ;) [[Special:Contributions/141.101.98.232|141.101.98.232]] 11:44, 13 June 2014 (UTC) | Is the problem behind Fermat's Last Theorem "deceptively simple" or "deceptively difficult"? I've never quite worked out which way it should be. Unlike "cheap at half the price" which really should be "cheap at twice the price" and the effect of putting in the word "only" into "glass ... half full/empty". But I bet you all could care less (or, more accurately, "''couldn't'' care less", because you already do not care at all), right? ;) [[Special:Contributions/141.101.98.232|141.101.98.232]] 11:44, 13 June 2014 (UTC) | ||
:I believe the correct wording would be "deceptively difficult". Deceptively simple would imply that the problem looked quite difficult on the surface, but once work had begun it was found to be quite simple. Fermat's last theorem goes the other way. It is simply stated with very few elements, so it would seem the proof should be easily constructed, but is actually quite difficult. {{unsigned ip|173.245.50.72}} | :I believe the correct wording would be "deceptively difficult". Deceptively simple would imply that the problem looked quite difficult on the surface, but once work had begun it was found to be quite simple. Fermat's last theorem goes the other way. It is simply stated with very few elements, so it would seem the proof should be easily constructed, but is actually quite difficult. {{unsigned ip|173.245.50.72}} | ||
− | |||
Is it at all possible that the exclamation: "oh," represents the discovery of an earlier proof (perhaps even better than the one purported) all ready in the margin? That would explain the next exclamation: "never mind." This is a comic after all. And what's with the unreadable Lorem Ipsum text (perhaps a proof in itself)? Of course, the unhappy face (after "never mind") is a visual image compression mechanism that may deserve comment as well. [[User:Run, you clever boy|Run, you clever boy]] ([[User talk:Run, you clever boy|talk]]) 14:36, 13 June 2014 (UTC) | Is it at all possible that the exclamation: "oh," represents the discovery of an earlier proof (perhaps even better than the one purported) all ready in the margin? That would explain the next exclamation: "never mind." This is a comic after all. And what's with the unreadable Lorem Ipsum text (perhaps a proof in itself)? Of course, the unhappy face (after "never mind") is a visual image compression mechanism that may deserve comment as well. [[User:Run, you clever boy|Run, you clever boy]] ([[User talk:Run, you clever boy|talk]]) 14:36, 13 June 2014 (UTC) | ||
− | + | == Why bury descriptions of the beautiful inspiration behind these great comics in an afterthought "trivia" section? == | |
I think explanations of the beautiful inspirations for these comics (like Fermat's last theorem, here) should be highlighted in the main part of the article, not buried below the transcript and demeaned with the label "trivia". [[User:Nealmcb|Nealmcb]] ([[User talk:Nealmcb|talk]]) 12:46, 13 June 2014 (UTC) | I think explanations of the beautiful inspirations for these comics (like Fermat's last theorem, here) should be highlighted in the main part of the article, not buried below the transcript and demeaned with the label "trivia". [[User:Nealmcb|Nealmcb]] ([[User talk:Nealmcb|talk]]) 12:46, 13 June 2014 (UTC) | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− |