Editing 342: 1337: Part 2
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 18: | Line 18: | ||
"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. | "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. | ||
β | [[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 | + | [[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.) | 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.) | ||
β | + | From the evidence that [[Mrs. Roberts]] has two children, a daughter named [[Help I'm trapped in a driver's license factory Elaine Roberts]], and a younger son named Bobby (presumably [[Robert'); DROP TABLE Students;--]], nicknamed Little Bobby Tables), 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 (assuming canonicity of title-text). In the title text to [[327: Exploits of a Mom]], 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. | |
==Transcript== | ==Transcript== |