Chapter III:
Another day of Lua scripting, when the prestigious Matthew made his appearance:
Aspie John, a programming novice, was immediately intrigued by the very mention of "bitwise operations". Aspie John quickly realized that Matthew's skill was well above that of himself and his fellow programmers. He monitored the thread for the remainder of the day, slightly bothered that he was too inexperienced to offer assistance.
This would serve as the start of his relationship with Matthew/"cntkillme"...
Still, Matthew did offer slight credit to the aspie:
Aspie John gradually slipped away from the tiresome questions of Scripting Helpers and moved on to other sections. He spent time in Off-Topic. Eventually, though, he went on hiatus, with the intention of perfecting his abilities.
Prior:
He experimented with the "os" functions provided in Lua. This was near the time when he started learning 'C' as well.
Our dear protagonist went on hiatus, finally...
Surprisingly, it was a bit easier than Aspie John expected, despite his NLD. The man learned basic concepts of graph theory and discrete mathematics, which allowed him to write simple string-based modules to handle programming problems.
Aspie's Hiatus(Still Gone):
View attachment 573538
View attachment 573540
(Fellow programmer, Sasayaki/"wazap")
He solved most of the problems from the old version of CoderByte(String Patterns, Arrays, Recursion, Factorials, Ciphers, solved a few "Hard" problems):
C:
He then reevaluated his Lua knowledge:
(Briefly experimented with MOAI and Love2D)
(Learned to use LuaSocket)
He looked at bits of the C code for Lua...
A certain degree of Mathematical Abstraction came along with his progression(NLD Feat):
Graphs:
The word "graph" has (at least) two meanings in mathematics. In elementary mathematics, "graph" refers to a function graph or "graph of a function," i.e., a plot. In a mathematician's terminology, a graph is a collection of points and lines connecting some (possibly empty) subset of them. The...
mathworld.wolfram.com
The traveling salesman problem is a problem in graph theory requiring the most efficient (i.e., least total distance) Hamiltonian cycle a salesman can take through each of n cities. No general method of solution is known, and the problem is NP-hard. The Wolfram Language command...
mathworld.wolfram.com
Unit Testing & Optimization:
Linear programming, sometimes known as linear optimization, is the problem of maximizing or minimizing a linear function over a convex polyhedron specified by linear and non-negativity constraints. Simplistically, linear programming is the optimization of an outcome based on some set of...
mathworld.wolfram.com
Computation time (also called "running time") is the length of time required to perform a computational process. Representation a computation as a sequence of rule applications, the computation time is proportional to the number of rule applications. In a logic-gate version of a quantum...
mathworld.wolfram.com
Logic:
One of the logic operators AND ^ , OR v , and NOT ¬.
mathworld.wolfram.com
The study of the meaning and relationships of statements used to represent precise mathematical ideas. Symbolic logic is also called formal logic.
mathworld.wolfram.com
Algebras:
A set is a finite or infinite collection of objects in which order has no significance, and multiplicity is generally also ignored (unlike a list or multiset). Members of a set are often referred to as elements and the notation a in A is used to denote that a is an element of a set A. The study...
mathworld.wolfram.com
A group G is a finite or infinite set of elements together with a binary operation (called the group operation) that together satisfy the four fundamental properties of closure, associativity, the identity property, and the inverse property. The operation with respect to which a group is defined...
mathworld.wolfram.com
A ring in the mathematical sense is a set S together with two binary operators + and * (commonly interpreted as addition and multiplication, respectively) satisfying the following conditions: 1. Additive associativity: For all a,b,c in S, (a+b)+c=a+(b+c), 2. Additive commutativity: For all a,b...
mathworld.wolfram.com
The concept of a space is an extremely general and important mathematical construct. Members of the space obey certain addition properties. Spaces which have been investigated and found to be of interest are usually named after one or more of their investigators. This practice unfortunately...
mathworld.wolfram.com
(Lua)
SPOJ/CodeChef(Lua, C, slight use of Perl)
(He had never used Python, LISP, Haskell, C++, Assembly, or Visual Basic much)
Finally, he indulged in Computer Science itself:
Algorithms:
The term "recursive function" is often used informally to describe any function that is defined with recursion. There are several formal counterparts to this informal definition, many of which only differ in trivial respects. Kleene (1952) defines a "partial recursive function" of nonnegative...
mathworld.wolfram.com
In database structures, two quantities are generally of interest: the average number of comparisons required to 1. Find an existing random record, and 2. Insert a new random record into a data structure. Some constants which arise in the theory of digital tree searching are alpha =...
mathworld.wolfram.com
A stack is a data structure which is a special kind of list in which elements may be added to or removed from the top only. These actions are called a push or a pop, respectively. Actions may be taken by popping one or more values, operating on them, and then pushing the result back onto the...
mathworld.wolfram.com
A database can be roughly defined as a structure consisting of 1. A collection of information (the data), 2. A collection of queries that can be submitted, and 3. A collection of algorithms by which the structure responds to queries, searches the data, and returns the results.
mathworld.wolfram.com
https://mathworld.wolfram.com/ReversePolishNotation.html (He had already briefly introduced himself to this concept while researching "Compilers")
Conceptual Machines(Data):
An abstract machine is a model of a computer system (considered either as hardware or software) constructed to allow a detailed and precise analysis of how the computer system works. Such a model usually consists of input, output, and operations that can be preformed (the operation set), and so...
mathworld.wolfram.com
Bytecode is computer object code that is compiled into machine code to be read by a computer's processor and then executed by the operating system.
whatis.techtarget.com
A floating-point number is a finite or infinite number that is representable in a floating-point format, i.e., a floating-point representation that is not a NaN. In the IEEE 754-2008 standard, all floating-point numbers - including zeros and infinities - are signed. IEEE 754-2008 allows for five...
mathworld.wolfram.com
Programming Paradigms:
Considering a modular programming approach? We unpack this programming principle with everything software developers need to know.
www.tiny.cloud
Considering a modular programming approach? We unpack this programming principle with everything software developers need to know.
www.tiny.cloud
Logic Gates:
Learn about what logic gates are, seven different basic logic gates and their truth tables. This definition also covers how they're made.
whatis.techtarget.com
He made his eventual, slight return:
Sadly, mental illness and race realism ruined his aspirations. He regressed from severe depression, and rotted for many years onward...
Then, he briefly learned a new language: GDScript:
It was brief, since he was too mentally-ill to enter the programming pattern again...
The realities of inceldom all too apparent...Tsk.