<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.explainxkcd.com/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=TheOnlyMrCat</id>
		<title>explain xkcd - User contributions [en]</title>
		<link rel="self" type="application/atom+xml" href="https://www.explainxkcd.com/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=TheOnlyMrCat"/>
		<link rel="alternate" type="text/html" href="https://www.explainxkcd.com/wiki/index.php/Special:Contributions/TheOnlyMrCat"/>
		<updated>2026-04-09T17:23:17Z</updated>
		<subtitle>User contributions</subtitle>
		<generator>MediaWiki 1.30.0</generator>

	<entry>
		<id>https://www.explainxkcd.com/wiki/index.php?title=2:_Petit_Trees_(sketch)&amp;diff=232736</id>
		<title>2: Petit Trees (sketch)</title>
		<link rel="alternate" type="text/html" href="https://www.explainxkcd.com/wiki/index.php?title=2:_Petit_Trees_(sketch)&amp;diff=232736"/>
				<updated>2022-05-03T22:04:52Z</updated>
		
		<summary type="html">&lt;p&gt;TheOnlyMrCat: Undo revision 232703 by X. K. C. D. (talk)&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;noinclude&amp;gt;:''&amp;quot;2&amp;quot;, this comic's number, redirects here. For the comic named &amp;quot;2&amp;quot;, see [[2614: 2]].''&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
{{comic&lt;br /&gt;
| number    = 2&lt;br /&gt;
| date      = September 30, 2005&lt;br /&gt;
| title     = Petit Trees (sketch)&lt;br /&gt;
| image     = tree_cropped_(1).jpg&lt;br /&gt;
| titletext = &amp;quot;Petit&amp;quot; being a reference to Le Petit Prince, which I only thought about halfway through the sketch&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
==Explanation==&lt;br /&gt;
This comic does not present a particular point; it is just a picture drawn by [[Randall]].&lt;br /&gt;
&lt;br /&gt;
''{{w|The Little Prince}}'' (in French ''Le Petit Prince)'' is a novella written by {{w|Antoine de Saint-Exupéry}} in 1943, about the titular Little Prince, who lives on an asteroid and visits other inhabited asteroids and eventually the Earth. The book is filled with drawings of the asteroid, the prince, and the travels they make. It is noted how, on occasion, {{w|Adansonia|baobab trees}} can begin to grow on these asteroids, and should they not be immediately uprooted, the growth of their roots would tear the asteroid apart. In this drawing, the roots are encircling the sphere, rather than piercing it, as Le Petit Prince describes.&lt;br /&gt;
&lt;br /&gt;
''The Little Prince'' has later been referenced both in [[618: Asteroid]] and in [[1350: Lorenz]] at [http://imgs.xkcd.com/comics/a1-2014/VgSdMz8OAHQ8w5Ee432f5Q.png the end] of the space trip branch. It was also referenced to in the What If article [https://what-if.xkcd.com/26/ Leap Seconds].&lt;br /&gt;
&lt;br /&gt;
==Transcript==&lt;br /&gt;
:[Two trees are growing on opposite sides of a sphere.]&lt;br /&gt;
&lt;br /&gt;
==Trivia==&lt;br /&gt;
*This was the 4th comic originally posted to [[LiveJournal]]. &lt;br /&gt;
**The previous was [[3: Island (sketch)]]. &lt;br /&gt;
**The next was [[1: Barrel - Part 1]].&lt;br /&gt;
*Original title: &amp;quot;Le Petit&amp;quot;&lt;br /&gt;
*Original [[Randall]] quote: &amp;quot;Another fairly old drawing that I scanned.&amp;quot;&lt;br /&gt;
*This was one of the [[:Category:First day on LiveJournal|thirteen first comics]] posted to LiveJournal within 12 minutes on Friday September 30, 2005.&lt;br /&gt;
*This comic was posted on [[xkcd]] when the web site opened on Sunday the 1st of January 2006.&lt;br /&gt;
**It was posted along [[:Category:First day on xkcd|with all 41 comics]] posted before that on LiveJournal as well as a few others.&lt;br /&gt;
**The latter explaining why the numbers of these 41 LiveJournal comics ranges from 1-44.&lt;br /&gt;
*One of the original drawings drawn on [[:Category:Checkered paper|checkered paper]].&lt;br /&gt;
&lt;br /&gt;
{{comic discussion}}&lt;br /&gt;
[[Category:Comics posted on livejournal| 04]]&lt;br /&gt;
[[Category:First day on LiveJournal| 04]]&lt;br /&gt;
[[Category:First day on xkcd]]&lt;br /&gt;
[[Category:Checkered paper]]&lt;br /&gt;
[[Category:Sketches]]&lt;/div&gt;</summary>
		<author><name>TheOnlyMrCat</name></author>	</entry>

	<entry>
		<id>https://www.explainxkcd.com/wiki/index.php?title=2610:_Assigning_Numbers&amp;diff=231170</id>
		<title>2610: Assigning Numbers</title>
		<link rel="alternate" type="text/html" href="https://www.explainxkcd.com/wiki/index.php?title=2610:_Assigning_Numbers&amp;diff=231170"/>
				<updated>2022-04-26T09:38:29Z</updated>
		
		<summary type="html">&lt;p&gt;TheOnlyMrCat: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{comic&lt;br /&gt;
| number    = 2610&lt;br /&gt;
| date      = April 22, 2022&lt;br /&gt;
| title     = Assigning Numbers&lt;br /&gt;
| image     = assigning_numbers.png&lt;br /&gt;
| titletext = Gödel should do an article on which branches of math have the lowest average theorem number.&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
==Explanation==&lt;br /&gt;
{{incomplete|Created by YÖDA'S COMPLETENESS THEOREM - Please change this comment when editing this page. Do NOT delete this tag too soon.}}&lt;br /&gt;
&lt;br /&gt;
'''This explanation is by mathematical necessity either incomplete or incorrect.'''&lt;br /&gt;
&lt;br /&gt;
[[Cueball]] is falling into a common trap, because a little knowledge is a dangerous thing. Faced with some sort of information, of an unknown kind but seemingly not intrinsically mathematical in nature, he has decided that one possible way to proceed is to somehow translate everything into values which can be combined and compared numerically.&lt;br /&gt;
&lt;br /&gt;
This is a very common thing to do, in fields as diverse as {{w|computational linguistics}} or {{w|sports analytics}}, and can be a powerful tool for understanding and learning new things about a subject as {{w|Data science}} tries to extract knowledge and insights from potentially noisy and disordered facts. But it is also used to implement bad science by using incorrect or misguided ideas about how to represent the source material. While it's possible to casually assign numeric values to random pieces of data, these numbers are generally not meaningful enough to compute with and draw any useful inferences from. It is generally possible to perform statistical analysis only on actual measurements, not on what may effectively be arbitrarily-assigned values.&lt;br /&gt;
&lt;br /&gt;
Machine learning algorithms, which are commonly used by data scientists, typically require all their inputs to be numerical. However, most datasets contains categorical features (e.g. the description of a piece of furniture: chair, table, ...). Data scientists therefore use encoding techniques to convert these categorical features to a numerical form so they can be used as inputs to a machine learning model. For instance, label encoding consists of arbitrarily assigning an integer to a category (chair=0, table=1, ...) which may appear meaningless to most observers. In various cases, they may be right.&lt;br /&gt;
&lt;br /&gt;
So, as well as being the mechanism that underlies one of the most profound theorems of 20th century mathematics, it can be mis-used for all kinds of bad or misguided science. From Cueball's attitude, it is far from clear that his attempt will reliably translate his project into a numerical system, nor that his attempt to &amp;quot;do math on it!&amp;quot; will be any more competent.&lt;br /&gt;
&lt;br /&gt;
One of the major characters who looked at the concept is Kurt Gödel. He introduced the idea of {{w|Gödel numbering}} with his landmark {{w|incompleteness theorems}}. In it a unique natural number is assigned to each axiom, statement, and proof, which might otherwise be difficult to accurately process in any other kind of approach. Instead, it is now possible to create metamathematical statements in the language of mathematics.&lt;br /&gt;
&lt;br /&gt;
This allowed Gödel to make the statement &amp;quot;This statement cannot be proven based on the axioms provided&amp;quot; in a mathematically rigorous way. A simple proof by contradiction shows that the statement cannot be false, and therefore (in most logical systems) must be true. The proof goes as follows: 1. Assume that &amp;quot;This statement cannot be proven from the axioms&amp;quot; (Call this statement G) is false (Call this assumption A). 2. Therefore G can be proven from the axioms (Because the negation of the negation is an affirmation.  Based only on A) 3. The axioms exist (Call this assumption B). 4. Therefore, G is true (via {{w|Modus ponens}} applied to 2 and 3, based on A and B). 5. Therefore, G and also not G (via And Introduction applied to 1 and 4, based on A and B). 6.  This is a contradiction, and therefore A or B must be wrong. We are not willing to sacrifice assumption B, so we must conclude that A is false, given B ({{w|Reductio ad absurdum}} applied to 1,3, and 5). 7.  Therefore, G.&lt;br /&gt;
&lt;br /&gt;
Notice that the truth of Gödel's statement does not depend on any particular set of axioms, and adding axioms (such as &amp;quot;Gödel's particular statement is true&amp;quot;) only opens up new iterations of the statement which cannot be proven based on the expanded set of axioms (A statement such as &amp;quot;All statements of a similar nature to Gödel's particular statement&amp;quot; is not precise enough to serve as an axiom.).  As such, with a little more legwork, it can be proven that any logical system robust enough to accommodate arithmetic must necessarily contain facts that are true within the system but cannot be proven or disproven within the system.  The importance of this result cannot be understated, as it upended the entire philosophy of mathematics.  {{w|David Hilbert}}'s famous proclamation &amp;quot;We must know, we will know&amp;quot; is simply incorrect.&lt;br /&gt;
&lt;br /&gt;
The title text suggests that Gödel should perform such an analysis on different branches of mathematics, by calculating the average of all the fields' theorems' Gödel numbers. This is nonsensical for a number of reasons: &lt;br /&gt;
:1) Gödel is long dead, and dead people can't write articles;{{Dubious}}&amp;lt;sup&amp;gt; - see [[599: Apocalypse]]&amp;lt;/sup&amp;gt;&lt;br /&gt;
:2) Gödel numbers grow very large very quickly, and depend heavily on the specific values assigned to each logical operator. Therefore the results could be manipulated simply by changing the numbering order of each operator;&lt;br /&gt;
:3) It may be very hard to gather all theorems in a field, or even a representative sample;&lt;br /&gt;
:4) Different fields of science, like biology or human behaviour, may not be able to write their theorems in the mathematical language of Gödel's incompleteness theorem&lt;br /&gt;
If anyone were to attempt this form of analysis, it would be an example of the bad data science described in the caption.&lt;br /&gt;
&lt;br /&gt;
==Transcript==&lt;br /&gt;
:[Cueball holds a hand up to his chin while he ponders the contents of what may be a whiteboard. There are five general lines of unreadable scribbling on the board, and between the two bottom lines, there is a square frame to the right with another scribble to the left. Cueball's thoughts are shown above him in a large thought bubble.]&lt;br /&gt;
:Cueball's thinking: If I assign numbers to each of these things, then it becomes '''''data''''', and I can do '''''math''''' on it!&lt;br /&gt;
&lt;br /&gt;
:[Caption  beneath the panel:]&lt;br /&gt;
:The same basic idea underlies Gödel's Incompleteness Theorem and all bad data science.&lt;br /&gt;
&lt;br /&gt;
{{comic discussion}}&lt;br /&gt;
[[Category:Math]]&lt;br /&gt;
[[Category:Comics featuring Cueball]]&lt;br /&gt;
[[Category:Logic]]&lt;/div&gt;</summary>
		<author><name>TheOnlyMrCat</name></author>	</entry>

	<entry>
		<id>https://www.explainxkcd.com/wiki/index.php?title=2556:_Turing_Complete&amp;diff=222742</id>
		<title>2556: Turing Complete</title>
		<link rel="alternate" type="text/html" href="https://www.explainxkcd.com/wiki/index.php?title=2556:_Turing_Complete&amp;diff=222742"/>
				<updated>2021-12-17T22:40:08Z</updated>
		
		<summary type="html">&lt;p&gt;TheOnlyMrCat: Add link to 2453&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{comic&lt;br /&gt;
| number    = 2556&lt;br /&gt;
| date      = December 17, 2021&lt;br /&gt;
| title     = Turing Complete&lt;br /&gt;
| image     = turing_complete.png&lt;br /&gt;
| titletext = Thanks to the ForcedEntry exploit, your company's entire tech stack can now be hosted out of a PDF you texted to someone.&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
==Explanation==&lt;br /&gt;
{{incomplete|Created by a BOTNET - Please change this comment when editing this page. Do NOT delete this tag too soon.}}&lt;br /&gt;
&lt;br /&gt;
A Turing Machine is a computer (of sorts) that has an infinite tape of ones and zeros and can change values and move up and down this tape. This very simple machine can do every computational task that what we think of as a &amp;quot;computer&amp;quot; can do. Something that is Turing Complete is able to emulate a Turing Machine (though generally with a finite tape), and this means it is also able to do basically every computational task. While many pieces of hardware and software are supposed to be Turing Complete (even Excel, as previously pointed out in [[2453: Excel Lambda]]), this comic implies that this was not what it was designed for. This presumably means Ponytail has found an exploit allowing for arbitrary code execution. This could be harmless and fun, like running Mario on a dishwasher, or a more serious security vulnerability that a nation-state could use to attack you. &lt;br /&gt;
==Transcript==&lt;br /&gt;
{{incomplete transcript|Do NOT delete this tag too soon.}}&lt;br /&gt;
[Ponytail and Cueball are standing next to each other]&lt;br /&gt;
...Now, it turns out this is actually Turing-Complete...&lt;br /&gt;
[caption below the panel:]&lt;br /&gt;
This phrase either means someone spent six months getting their dishwasher to play Mario or you are under attack by a nation-state.&lt;br /&gt;
{{comic discussion}}&lt;/div&gt;</summary>
		<author><name>TheOnlyMrCat</name></author>	</entry>

	</feed>