| Latest revision |
Your text |
| Line 8: |
Line 8: |
| | | | |
| | ==Explanation== | | ==Explanation== |
| − | This is the second part of five in the "[[:Category:1337|1337]]" series. The title 1337 is "L-eet," or "elite," using the {{w|Leet}} alphabet, a coding system used primarily on the internet (and on early text messaging systems), meant to provide a bit of {{w|obfuscation}} to plain text both to make it harder to read and to show off in a creative way using in-group jargon.
| + | {{w|Donald Knuth}} is a computer science Professor Emeritus at {{w|Stanford University}} who is famous for writing {{w|The Art of Computer Programming}} and developing the <span class="texhtml"><span style="font-family:cmr10, LMRoman10-Regular, Times, serif;">T<span style="text-transform:uppercase; vertical-align:-0.5ex; margin-left:-0.1667em; margin-right:-0.125em;">e</span>X</span></span> computerized typesetting system. He may not have a mountain hideaway (a reference to ''{{w|Kill Bill}}'', by the way), but he would be one of the best mentors a budding hacker could have. |
| | | | |
| − | This series was released on five consecutive days (Monday to Friday) and not over the usual schedule of three comics a week. These are all the comics in [[:Category:1337|1337 series]]:
| + | The {{w|A* search algorithm}} and {{w|Dijkstra's algorithm}} are {{w|Graph traversal|graph search}} {{w|algorithm}}s. And what study of algorithms would be complete without a healthy study about finding complexities? {{w|Computational complexity theory|Time complexity}} is the amount of time an algorithm takes to execute. Upper and lower bounds for complexity is written in {{w|Big O notation}}. Best possible execution of an algorithm is constant time, or O(1), said in words, for any given data set no matter how large the algorithm will always return the answer in the same time. However, constant time is extremely difficult to achieve, linear time (O(n)) is also very good. For more complex algorithms, [http://www.wolframalpha.com/input/?i=plot+x*log%28x%29 O( n*log(n) )] is good, but [http://www.wolframalpha.com/input/?i=plot+x*log%28log%28x%29%29 O( n*log(log(n)) )] is better. (Note that logarithms in different bases are proportional to each other. So this would hold true for any base >1.) |
| − | * [[341: 1337: Part 1]] | |
| − | * [[342: 1337: Part 2]] | |
| − | * [[343: 1337: Part 3]]
| |
| − | * [[344: 1337: Part 4]] | |
| − | * [[345: 1337: Part 5]] | |
| | | | |
| − | "Like a ring in a bell" appears to be a reference to the {{w|Chuck Berry}} song {{w|Johnny B. Goode}}, in which Berry describes a young boy (like himself) who becomes a guitar-playing prodigy. The original lyric was "just like a-ringing a bell." Apparently, [[Help I'm trapped in a driver's license factory Elaine Roberts|Elaine Roberts]] learned to program as quickly, easily, and skillfully as Johnny (and Chuck) learned to play rock 'n' roll.
| + | From the evidence that [[Mrs. Roberts]] has two children, a daughter named [[Elaine Roberts|Elaine]], and a younger son named [[Little Bobby Tables|Bobby]], we can assume that she is the same mother from [[327: Exploits of a Mom]]. Of course, the title text here explains that Elaine is only her middle name. In [[327]] we learned her first name is "Help I'm trapped in a driver's license factory". Mrs. Roberts appears to have had fun naming her children. |
| − | [[Donald Knuth]] is a computer science Professor Emeritus at {{w|Stanford University}} who is famous for writing {{w|The Art of Computer Programming}} and developing the <span class="texhtml"><span style="font-family:cmr10, LMRoman10-Regular, Times, serif;">T<span style="text-transform:uppercase; vertical-align:-0.5ex; margin-left:-0.1667em; margin-right:-0.125em;">e</span>X</span></span> computerized typesetting system. He may not have a mountain hideaway (a reference to ''{{w|Kill Bill}}'', by the way, as is the whole training sequence), but he would be one of the best mentors a budding hacker could have. | |
| | | | |
| − | The {{w|A* search algorithm}} and {{w|Dijkstra's algorithm}} are {{w|Graph traversal|graph search}} {{w|algorithm}}s. And what study of algorithms would be complete without a healthy study about finding complexities? {{w|Computational complexity theory|Time complexity}} is the amount of time an algorithm takes to execute. Upper and lower bounds for complexity is written in {{w|Big O notation}}. Best possible execution of an algorithm is constant time, or O(1), said in words, for any given data set, no matter how large, the algorithm will always return the answer at the same time. However, constant time is extremely difficult to achieve; linear time (O(n)) is also very good. For more complex algorithms, [https://www.wolframalpha.com/input/?i=plot+x*log%28x%29 O( n*log(n) )] is good, but [https://www.wolframalpha.com/input/?i=plot+x*log%28log%28x%29%29 O( n*log(log(n)) )] is better. (Note that logarithms in different bases are proportional to each other. So, this would hold true for any base >1.)
| + | All comics in "[[:Category:1337|1337]]" series: |
| | + | *[[341: 1337: Part 1]] |
| | + | *342: 1337: Part 2 (this one) |
| | + | *[[343: 1337: Part 3]] |
| | + | *[[344: 1337: Part 4]] |
| | + | *[[345: 1337: Part 5]] |
| | | | |
| − | Knowing that [[Mrs. Roberts]] has two children, this daughter named Elaine and the son named Bobby, is the key indicator that this is the mother previously noted as having given her children particularly strange names. Of course, the title text here explains that Elaine is only her middle name (assuming canonicity of title-text), but it was in the title text to [[327: Exploits of a Mom]] that we learned that her first name is "Help I'm trapped in a driver's license factory". Mrs. Roberts appears to have had fun naming her children.
| + | This series was released on 5 consecutive days (Monday-Friday) and not over the usual Monday/Wednesday/Friday schedule. |
| | | | |
| | ==Transcript== | | ==Transcript== |
| − | :[Cueball standing and looking down at his Cueball-like friend, who is sitting on the floor near an armchair holding a cloth to his face.] | + | :[Cueball standing near a friend, who is on the floor near the armchair.] |
| | :Friend: So the greatest hacker of our era is a cookie-baking mom? | | :Friend: So the greatest hacker of our era is a cookie-baking mom? |
| | :Cueball: Second-greatest. | | :Cueball: Second-greatest. |
| | :Friend: Oh? | | :Friend: Oh? |
| | | | |
| − | :[The next panel is only half height as Cueball's narration is written as a caption above the panel without a frame around it. In the panel to the left lies a young Elaine with a ponytail on the floor typing at a keyboard while looking at a screen connected to a computer behind it with lots of wires and open case. The computer appears to have been pieced together and there is a screwdriver lying next to her and an open box lies behind her. Little Bobby Tables (a kid version of Cueball) is painting with a broad brush at an easel to the left. There is a clear drawing with two parts going up and one down, but it's not easy to see what it should look like. He is holding his other hand up in the air, like he is enjoying the painting.] | + | :[A young Elaine with a ponytail is laying on the floor looking at the screen of a computer that appears to have been pieced together. A younger Bobby is finger painting at an easel.] |
| − | :Cueball (narrating): Mrs. Roberts had two children. Her son, Bobby, was never much for computers, but her daughter Elaine took to them like a ring in a bell.
| + | :Mrs. Roberts had two children. Her son, Bobby, was never much for computers, but her daughter Elaine took to them like a ring in the bell. |
| | | | |
| − | :[The front of a car is in frame with side mirror and steering wheel visible. Mrs. Roberts is waving goodbye to her daughter who is wearing a backpack and is holding a walking stick. She is about to begin climbing a staircase built into a rocky mountain side. The first 11 step are visible. Behind the two and the stair are two distant mountain peaks, and above them two clouds. Cueball continues to narrate, this time inside the panel:] | + | :[The back of a car is in frame. Mrs. Roberts is waving goodbye to her daughter who is wearing a backpack and is holding a walking stick. She is about to begin climbing a staircase built into a mountain.] |
| − | :Cueball (narrating): When Elaine turned 11, her mother sent her to train under Donald Knuth in his mountain hideaway.
| + | :When Elaine turned 11, her mother sent her to train under Donald Knuth in his mountain hideaway. |
| | | | |
| − | :[Donald Knuth, drawn with hair only around his neck, is standing with a pointing stick at a chalk board with graph traversal patterns on it and two blocks of unreadable text the top may be a matrix. This small panel is also lower than the next panel, with Cueball's narration above:] | + | :[Donald Knuth is standing with a pointing stick at a chalk board with graph traversal patterns on it.] |
| − | :Cueball (narrating): For four years she studied algorithms.
| + | :For four years she studied algorithms. |
| − | :Donald Knuth: Child— | + | :Knuth: Child— |
| | | | |
| − | :[Donald Knuth whips around from the board slashing the stick like a sword. Elaine jumps, making a somersault (indicated with a line curving on it self from floor to sword) and lands on the stick balancing with her arms out.] | + | :[Knuth whips around slashing the stick like a sword. Elaine jumps and lands on the stick.] |
| − | :Donald Knuth: Why is A* search wrong in this situation? | + | :Knuth: Why is A* search wrong in this situation? |
| − | :Stick: ''swish''
| + | :''swish'' |
| | :Elaine: Memory usage! | | :Elaine: Memory usage! |
| − | :Donald Knuth: What would <u>you</u> use? | + | :Knuth: What would you use? |
| | :Elaine: Dijkstra's algorithm! | | :Elaine: Dijkstra's algorithm! |
| | | | |
| − | :[Donald Knuth and Elaine are outside, seen from behind while they are both writing on a chalkboard with a thick line down the middle to separate their work. On both sides their writing can be seen but it is unreadable. Where there is only text visible on Donald Knuth's side there is also what appears to be a drawing or matrix at the top of Elaine's. But a similar thing could be behind Donald Knuth's head. Elaine is no longer wearing her hair in a ponytail but have long straight white hair like her mom, Mrs. Roberts. To the left there is a stump from a tree, some grass and maybe a puddle of water. Further back there is a small jagged hill and a flat horizon. To the right there are four mountain peaks and a flat high plateau towards the horizon. The frame of the panel does not include the top-left and bottom-right corners, but cuts round a rectangular section of both places. In these two sections, outside the panel, are the last two paragraphs of Cueball's narrating:] | + | :[They are outside both working on a chalkboard with a separator down the middle so they cannot look at each other's work. Elaine is no longer wearing her hair in a ponytail.] |
| − | :Cueball (narrating): Until one day she bested her master
| + | :Until one day she bested her master |
| − | :Donald Knuth: So our lower bound here is O(n log n) | + | :Knuth: So our lower bound here is O(n log n) |
| | :Elaine: Nope. Got it in O(n log (log n)) | | :Elaine: Nope. Got it in O(n log (log n)) |
| − | :Cueball (narrating): And left.
| + | :And left. |
| | | | |
| | ==Trivia== | | ==Trivia== |
| − | *In this [https://www.youtube.com/watch?v=zJOS0sV2a24#t=21m30s Google-speech] Donald Knuth personally asked [[Randall]] what his ''n*log(log(n))'' algorithm for searching was, and Randall referred him to Elaine. | + | *[[Mrs. Roberts]]' son Bobby, might be the <code>Robert'); DROP TABLE students;--</code> a.k.a. "[[Little Bobby Tables]]" in [[327: Exploits of a Mom]], it certainly seems a little too close to call a coincidence. |
| − | *Elaine is actually her middle name.
| + | *In this [http://www.youtube.com/watch?v=zJOS0sV2a24#t=21m30s Google-speech] Donald Knuth personally asked [[Randall]] what his ''n*log(log(n))'' algorithm for searching was, and Randall referred him to Elaine. |
| | | | |
| | {{comic discussion}} | | {{comic discussion}} |
| − |
| |
| − | [[Category:1337|02]]
| |
| − | [[Category:Comics sharing name|1337]]
| |
| | [[Category:Comics featuring Cueball]] | | [[Category:Comics featuring Cueball]] |
| − | [[Category:Comics featuring Help I'm trapped in a driver's license factory Elaine Roberts]] | + | [[Category:Comics featuring Elaine Roberts]] |
| − | [[Category:Comics featuring Robert'); DROP TABLE Students;--]]
| |
| | [[Category:Comics featuring Mrs. Roberts]] | | [[Category:Comics featuring Mrs. Roberts]] |
| | + | [[Category:Comics featuring Little Bobby Tables]] |
| | [[Category:Comics featuring Donald Knuth]] | | [[Category:Comics featuring Donald Knuth]] |
| − | [[Category:Multiple Cueballs]] <!-- first panel --> | + | [[Category:1337|02]] |
| − | [[Category:Computers]]
| |
| − | [[Category:Kids]]
| |
