User contributions for PkmnQ

00:3300:33, 20 February 2025 diff hist +110‎ N Talk:Bitchanger Busy beaver ‎ Created page with "What was used to confirm these? -~~~~"

04:4404:44, 9 February 2025 diff hist +5‎ m ™ ‎ 48 can interpret a language with a Truth machine, but can't itself make a Truth machine.

08:5708:57, 5 February 2025 diff hist +177‎ Talk:Omniglot ‎No edit summary current
03:3003:30, 5 February 2025 diff hist +163‎ N Talk:Omniglot ‎ Created page with "I have an omniglot. <pre> </pre> It runs the "successfully run this program" program. -~~~~"

13:0713:07, 2 February 2025 diff hist +285‎ Recursive ‎ →‎Example programs: Just realized that this is also a thing Recursive can do current
12:4912:49, 2 February 2025 diff hist +338‎ Talk:25 bytes o: ‎No edit summary

16:5016:50, 26 January 2025 diff hist +175‎ Joke language list ‎ →‎General languages: Recursive and <nowiki>[[Category:No-code esolang Category:Unimplemented</nowiki>]]
16:4416:44, 26 January 2025 diff hist +253‎ N Talk:-1 ‎ Created page with "Kind of surprised this wasn't taken earlier. I noticed and had a plan for this a while ago, but I couldn't find a way to make it work. Nice to finally see an esolang named -1. -~~~~" current
16:4116:41, 26 January 2025 diff hist +3,921‎ N The last line of this page ‎ Created page with "{{Wrongtitle|title=<nowiki>Category:No-code esolang Category:Unimplemented</nowiki>}} <nowiki>[[Category:No-code esolang Category:Unimplemented</nowiki>]] is a no-code esolang. However, while these are usually easy to interpret, this language is impossible to interpret (though it's very easy to get close). This is not just true due to uncomputability, as it is also equally as impossible for Banana..." current
14:2014:20, 26 January 2025 diff hist +241‎ Recursive ‎ →‎See also
14:1114:11, 26 January 2025 diff hist +17‎ m ™ ‎ forgot to add this
13:5313:53, 26 January 2025 diff hist +887‎ ™ ‎ →‎Dialects created in 2025: Recursive derivatives

16:5316:53, 15 January 2025 diff hist +1,414‎ N ++=== ‎ Created page with "++=== is a register-based OISC with no branching. The name is a concatenation of <code>++</code>, <code>==</code>, and <code>=</code>, describing the singular instruction (<code>if (*A++ == *B) *A = *C;</code>). == Specification == Memory in ++=== consists of indefinitely many registers containing non-negative integers initialized at 0, though only finitely many can be used in the program. Programs consist of commands, each naming three..."

00:5300:53, 8 January 2025 diff hist +1,103‎ N Kolakoski sequence ‎ Created page with "The Kolakoski sequence is a sequence of 1's and 2's such that if you take the lengths of each run of the sequence, the result is the same as the original sequence. There are actually two sequences that fit this definition with their only difference being a 1 at the beginning. Its first 16 terms are: 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, ... There are a few different ways to generate the sequence, such as iteratively making bigger copies of the sequence fro..."