Differences

This shows you the differences between two versions of the page.

--- fuss:computer_science [2019/03/08 23:56] – created office
+++ fuss:computer_science [2025/10/21 23:26] (current) – external edit 127.0.0.1
@@ Line 1: / Line 1: @@
-====== Index ======
+====== Von-Neumann Debiasing ======
+Von-Neumann debiasing can be used to remove entropy bias from a sequence of random or pseudo-random binary digits using a simple algorithm.
+Given the set of binary digits:
+\begin{eqnarray*}
+B &=& \{ k | k \in \{ 0, 1 \} \} \\
+\end{eqnarray*}
+and $S$ a sequence of arbitrary binary digits:
+\begin{eqnarray*}
+S &=& {\huge\bullet_{i=1}^{n}} k_{i},k_{i} \in B,n \ge 2
+\end{eqnarray*}
+Let $r_{i}$ be a debiased random binary number such that:
+\begin{equation}
+r_{i} =
+\begin{cases}
+& k_{i-1} = 0,k_{i} = 1  \\
+& k_{i-1} = 1,k_{i} = 0
+\end{cases}
+\end{equation}
+The following table shows the possible outcomes for the random binary digit $r_{i}$:
+^ $k_{i-1}$ ^ $k_{i}$ ^ $r_{i}$ ^
+| 0 | 0 | discard |
+| 0 | 1 | 0 |
+| 1 | 0 | 1 |
+| 1 | 1 | discard |
+====== Exercises ======
+You can find [[/fuss/computer_science/exercises|a list of computer science exercises on their dedicated page]].
+====== Definition of a Line of Text ======
+A line of text [[https://pubs.opengroup.org/onlinepubs/9699919799/basedefs/V1_chap03.html#tag_03_206|is defined by POSIX]] as:
+<WRAP info>
+.206 Line
+        A sequence of zero or more non-<newline> characters plus a terminating <newline> character.
+</WRAP>
+Regular Expression:
+<code>
+/^[^\n]+?$/gm
+</code>
+where the following regular expression engine modifiers have to be set:
+  * ''g'' is a greedy flag (in order to match all the lines in a document),
+  * ''m'' is a multi-line match flag
+Due to the definition many programs and environments (for example, [[/fuss/lsl|the LSL programming language]]) processing the last line in a text file iff. the last line is not terminated by a newline character.
+====== The Empty String, List, Queue, Etc... ======
+One confusing concept to non-computer science majors is the concept behind the expression "the empty string", or "the empty list", or "the empty queue". These expressions are the closest to mathematics when defined.
+All variables are considered from a memory model perspective containers and that types are qualifiers for those containers. In that sense, "the empty O" where "O" is a type, refers to a container of a given type that currently has nothing stored inside. With collections and co-variance, the concepts become more complex where variables refer to containers and then those containers, in turn, can be empty.
+The following definitions can then be constructed:
+  * an empty string is a string container that contains zero characters and is referred to by a given variable
+    * on a technical layer zero characters could be represented by a single end-of-string character ''\0'', or perhaps by setting all the allocated memory to zero,
+  * an empty list is a list container that contains zero element
+    * on a technical layer, usually a list contains a counter of its internal size (ie: for linked lists), which in the case that the list is empty, should be zero
+    * bear in mind that if lists are to be considered sets, then a set $l$ such that $l = \varnothing$ is still a valid set containing nothing
+Object-oriented programming makes theoretical computer science more perceivable at the level of code, where objects are synonymous with types, such that a "string", "list" / "set", "queue", etc, will greatly exceed their memory-model conceptualization and will tend to be closer to their mathematical abstraction. Pragmatic programming languages tend to blur the understanding that variables are nothing more than containers when it comes to data.
-{{indexmenu>fuss/computer_science}}