Editing 1833: Code Quality 3

Jump to: navigation, search

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 26: Line 26:
 
   ]
 
   ]
  
βˆ’
{{w|Alan Turing}} was a British theoretical computer scientist, often considered the father of the field. His [https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf 1936 paper] outlined Turing machines, a theoretical model for computing, as well as computability and the halting problem. Theoretical computer science is very different from practical coding; understanding the contents of the paper would not at all help a coder to understand today's algorithms, design patterns, and best practices. This is not helped by a page of JavaScript example code. {{w|JavaScript}} is a popular programming language which makes web pages responsive to user inputs, and while JavaScript arguably solves the problem in a practical manner (as opposed to Turing's very theoretical work), it does get a lot of criticism - for instance it is {{w|Strong and weak typing|nearly untyped}}, which allows the programmer to do very interesting things, like {{w|JSFuck}}. Then, example code is used to explain a concept in programming or demonstrate how a program works, but it does not actually run on any computer. "Guessing everything in between" would involve attempting to write code using skills that could range anywhere from the most basic programming to Turing's extremely advanced ideas.
+
{{w|Alan Turing}} was a British theoretical computer scientist, often considered the father of the field. His [https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf 1936 paper] outlined Turing machines, a theoretical model for computing, as well as computability and the halting problem. Theoretical computer science is very different from practical coding; understanding the contents of the paper would not at all help a coder to understand today's algorithms, design patterns, and best practices. This is not helped by a page of Javascript example code. {{w|Javascript}} is a popular programming language which makes web pages responsive to user inputs, and while Javascript arguably solves the problem in a practical manner (as opposed to Turing's very theoretical work), it does get a lot of criticism - for instance it is {{w|Strong and weak typing|nearly untyped}}, which allows the programmer to do very interesting things, like {{w|JSFuck}}. Then, example code is used to explain a concept in programming or demonstrate how a program works, but it does not actually run on any computer. "Guessing everything in between" would involve attempting to write code using skills that could range anywhere from the most basic programming to Turing's extremely advanced ideas.
  
 
In the final panel, Ponytail references {{w|leet|leet-speak}}, in which symbols are replaced with similar-looking symbols, and a {{w|manifesto}}, a statement of a person or group's beliefs and intentions. A manifesto from a survivalist cult leader might be nonsensical, even before being translated to leet-speak. Memory allocation is a low-level computer programming concept; most modern languages have features that take care of memory allocation for the programmer, possibly implying that Cueball does not know how to use these features.
 
In the final panel, Ponytail references {{w|leet|leet-speak}}, in which symbols are replaced with similar-looking symbols, and a {{w|manifesto}}, a statement of a person or group's beliefs and intentions. A manifesto from a survivalist cult leader might be nonsensical, even before being translated to leet-speak. Memory allocation is a low-level computer programming concept; most modern languages have features that take care of memory allocation for the programmer, possibly implying that Cueball does not know how to use these features.
Line 34: Line 34:
 
{{w|Forth_(programming_language)#Programmer.27s_perspective|Forth}} is an old programming language that tends to be difficult to read. It is stack-based, meaning that values to be operated on are moved on a {{w|Stack (abstract data type)|stack}} before the operation to be performed is given. Using stacks can be considered different from programming languages that resemble natural human language (e.g. {{w|COBOL}}). While stack-based computing makes some problems very simple (for example, it is relatively simple to design a Forth compiler, or reversing the order of an array) and uses less computing resources, such programming languages are not easy to learn. Since Forth allows the programmer to rewrite the language, or define their own language, and it does not enforce restrictions like data types, it may be especially easy for novices to write cryptic code.
 
{{w|Forth_(programming_language)#Programmer.27s_perspective|Forth}} is an old programming language that tends to be difficult to read. It is stack-based, meaning that values to be operated on are moved on a {{w|Stack (abstract data type)|stack}} before the operation to be performed is given. Using stacks can be considered different from programming languages that resemble natural human language (e.g. {{w|COBOL}}). While stack-based computing makes some problems very simple (for example, it is relatively simple to design a Forth compiler, or reversing the order of an array) and uses less computing resources, such programming languages are not easy to learn. Since Forth allows the programmer to rewrite the language, or define their own language, and it does not enforce restrictions like data types, it may be especially easy for novices to write cryptic code.
  
βˆ’
A {{w|cryptogram}} is a cipher puzzle, generally one easy enough to be solved manually. The title text implies that the code is so bad that it looks like unreadable Forth code that is missing random characters.
+
A {{w|cryptogram}} is a cipher puzzle, generally one easy enough to be solved manually. The title text implies that the code is so bad that it looks like unreadable FORTH code that is missing random characters.
  
 
==Transcript==
 
==Transcript==

Please note that all contributions to explain xkcd may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see explain xkcd:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel | Editing help (opens in new window)