mathematical

2/5/2022, 12:30 am Message reputation : 100% (1 vote)

Hiya guys it's Scheisse!

just here to remind you all of the new RijiRules!!

my favorite of the bunch is Sir Herbert Pisswhipple's

Turing-complete RijiPost Regulation

"ALL posts MUST be Turing-complete, this is important! If a binary-based operating system CANNOT be derived from EACH post you make, then you deserve to have your funnies EXPUNGED and your RijiPoints:tm: REDACTED"

violators will be shot

Reminder of what entails Turing-completeness

A Turing machine is a general example of a central processing unit (CPU) that controls all data manipulation done by a computer, with the canonical machine using sequential memory to store data. More specifically, it is a machine (automaton) capable of enumerating some arbitrary subset of valid strings of an alphabet; these strings are part of a recursively enumerable set. A Turing machine has a tape of infinite length on which it can perform read and write operations.

Assuming a black box, the Turing machine cannot know whether it will eventually enumerate any one specific string of the subset with a given program. This is due to the fact that the halting problem is unsolvable, which has major implications for the theoretical limits of computing.

The Turing machine is capable of processing an unrestricted grammar, which further implies that it is capable of robustly evaluating first-order logic in an infinite number of ways. This is famously demonstrated through lambda calculus.

A Turing machine that is able to simulate any other Turing machine is called a universal Turing machine (UTM, or simply a universal machine). A more mathematically oriented definition with a similar "universal" nature was introduced by Alonzo Church, whose work on lambda calculus intertwined with Turing's in a formal theory of computation known as the Church–Turing thesis. The thesis states that Turing machines indeed capture the informal notion of effective methods in logic and mathematics, and provide a precise definition of an algorithm or "mechanical procedure". Studying their abstract properties yields many insights into computer science and complexity theory.

hope you all have fun on the new and improved site!!!!!