All public logs

Combined display of all available logs of Esolang. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 17:17, 29 April 2025 Stkptr talk contribs created page Mlatu (Create page)
• 22:04, 27 April 2025 Stkptr talk contribs created page User:Stkptr/Sandbox (Created page with "== Queuenanimous == We can represent several unary numbers in the queue by having ones be 10 and separators be 00. If a unary number is at the head of the queue, we can subtract one from it using <code>[]</code>, which pops off the 1, loops back, then pops off the 0, and exits. Consider the behavior of [+0]. If there is a nonzero number at the head of the queue, then this will M = [] R = [+0]>0 L = RR P = ??L")
• 23:22, 25 April 2025 Stkptr talk contribs created page Functional calculus (They are all relatives yet have no good umbrella term)
• 20:10, 25 April 2025 Stkptr talk contribs created page Concatenative calculus (Preliminary)
• 17:39, 24 April 2025 Stkptr talk contribs created page Category:Pages with math errors (Created page with "This is an automatically generated category which is added to pages where <math></math> wikitext failed to properly render. This can be due to erroneous LaTeX, or failure to connect to the rendering server. If the latter, you can refresh the page rendering by clicking edit page, then immediately submitting without performing any actual changes.")
• 17:39, 24 April 2025 Stkptr talk contribs created page Category:Pages with math render errors (Created page with "This is an automatically generated category which is added to pages where <math></math> wikitext failed to properly render. This can be due to erroneous LaTeX, or failure to connect to the rendering server. If the latter, you can refresh the page rendering by clicking edit page, then immediately submitting without performing any actual changes.")
• 16:16, 24 April 2025 Stkptr talk contribs moved page @!+-() Turing-completeness Proof to Queuefuck (The language presented is worthy of its own page)
• 06:09, 24 April 2025 Stkptr talk contribs created page Qoob (Created page with "{{lowercase}} {{infobox proglang |name=qoob |paradigms=imperative |author=User:stkptr |year=2025 |memsys=queue |dimensions=one-dimensional |class=Turing complete |refimpl=... |influence=Cyclic tag, brainfuck, G85, Queuenanimous |files=<code>.qoob</code> }} '''qoob''' (/kub/ or /qub/, for queue + loop + based) is a queue-based language with 3 constructs. * <code>0</code> enqueue a zero at the back of the queue * <code>...")
• 17:49, 23 April 2025 Stkptr talk contribs created page Binary tag (Created page with ": ''Not to be confused with 2-tag or bi-tag.'' '''Binary tag''' refers to specific tag systems where there are only two symbols.<ref>Neary, Turlough. (2013, Dec 19). Undecidability in binary tag systems and the Post correspondence problem for four pairs of words. arXiv. arXiv:1312.6700 https://doi.org/10.48550/arXiv.1312.6700</ref> Neary proved binary tag Turing complete assuming the deletion number can be arbitrarily large. Nea...")
• 05:50, 23 April 2025 Stkptr talk contribs created page Nondeterministic (Created page with "In computer science, a system is considered '''nondeterministic''' if, at some point during its evolution, there are multiple valid paths it can take in a single step. Nondeterminism literally means lacking determinism. Determinism in this context refers to the execution path being determined from the initial conditions. A system (e.g. a program) evolves deterministically if, at every point in the execution, only one possible execution path can (and therefore must) be ta...")
• 22:01, 22 April 2025 Stkptr talk contribs created page Iterated regex (Create page, more to come)
• 18:08, 21 April 2025 Stkptr talk contribs created page Regular language (Redirected page to Formal grammar) Tag: New redirect
• 23:08, 16 April 2025 Stkptr talk contribs created page Metalanguage (Create page)
• 01:16, 15 April 2025 Stkptr talk contribs created page T-rexes (Create page)
• 00:05, 14 April 2025 Stkptr talk contribs created page Context-sensitive language (Redirected page to Context-sensitive grammar) Tag: New redirect
• 00:04, 14 April 2025 Stkptr talk contribs created page Semi-Thue grammar (Redirected page to Formal grammar) Tag: New redirect
• 00:03, 14 April 2025 Stkptr talk contribs created page Unrestricted grammar (Redirected page to Formal grammar) Tag: New redirect
• 00:03, 14 April 2025 Stkptr talk contribs created page Context-free grammar (Redirected page to Formal grammar) Tag: New redirect
• 00:02, 14 April 2025 Stkptr talk contribs created page Context-sensitive grammar (Redirected page to Formal grammar) Tag: New redirect
• 00:02, 14 April 2025 Stkptr talk contribs created page Formal grammar (It's a start, I can't figure out the math formatting yet)
• 15:11, 12 April 2025 Stkptr talk contribs created page Pseudocode (College Board) (create)
• 05:11, 6 April 2025 Stkptr talk contribs created page Smallest universal function (Create page)
• 21:21, 5 April 2025 Stkptr talk contribs created page Coral (Created page with "Coral may refer to any of the following languages: * Coral (zyBooks) an educational programming language with 3-space indents * Coral (Python) a gradually typed compiled subset of Python * Coral 66 (Wikipedia) an language based on ALGOL used by the British Ministry of Defence")
• 21:10, 5 April 2025 Stkptr talk contribs created page Coral (Python) (Create)
• 20:41, 5 April 2025 Stkptr talk contribs created page Coral (zyBooks) (Create page)
• 04:39, 30 March 2025 Stkptr talk contribs created page Talk:Unsmiley (Created page with "== Computability == Since this can arbitrarily modify its own specification, could it be uncomputable? What are the limits of its self rewriting? Could it add a command which solves the halting problem? ~~~~")
• 20:04, 28 March 2025 Stkptr talk contribs created page L-system (create page)
• 19:39, 28 March 2025 Stkptr talk contribs created page Pushdown automata (Redirected page to Push-down automaton) Tag: New redirect
• 19:36, 28 March 2025 Stkptr talk contribs created page Linear bounded automata (Redirected page to Linear bounded automaton) Tag: New redirect
• 19:11, 27 March 2025 Stkptr talk contribs created page Total (Redirected page to Total function) Tag: New redirect
• 19:11, 27 March 2025 Stkptr talk contribs created page Partial (Redirected page to Partial function) Tag: New redirect
• 19:10, 27 March 2025 Stkptr talk contribs created page Partial function (Redirected page to Total function) Tag: New redirect
• 19:10, 27 March 2025 Stkptr talk contribs created page Total function (Created page with "A '''total function''' is a function which is defined for all inputs, that is, no input to the function will ever result in the answer ''undefined''. In the context of computer science, machines which halt (or equivalent definitions) on a given input are considered to have a defined output. Machines which do not halt on a given input are considered to have an undefined output. Therefore, a machine which halts on all inputs is ''total'' since it models a total function of...")
• 00:02, 27 March 2025 Stkptr talk contribs created page Lag system (corate pagə)
• 21:14, 26 March 2025 Stkptr talk contribs created page Bi-tag system (crate pag)
• 20:02, 26 March 2025 Stkptr talk contribs created page Clockwise Turing machine (creat)
• 23:51, 25 March 2025 Stkptr talk contribs created page Signals (Create page)
• 21:06, 25 March 2025 Stkptr talk contribs created page Diophantine equation (Create page)
• 17:19, 13 March 2025 Stkptr talk contribs created page Finite state automata (Redirect to the singular) Tag: New redirect
• 22:52, 12 March 2025 Stkptr talk contribs created page General blindfolded arithmetic (Create page with current thoughts)
• 04:26, 12 March 2025 Stkptr talk contribs created page Bitwise cyclic tag (Add typical cased redirect) Tag: New redirect
• 00:43, 12 March 2025 Stkptr talk contribs created page Rotary/Proof of Turing completeness (It's TC)
• 18:52, 9 March 2025 Stkptr talk contribs created page ◧◨/Interpreters (Add an implementation in Python)
• 19:53, 8 March 2025 Stkptr talk contribs created page Oracle machine (Create page)
• 19:00, 8 March 2025 Stkptr talk contribs created page Uncomputable (Redirect to computable, this is an important concept so it should be easily accessible) Tag: New redirect
• 04:34, 7 March 2025 Stkptr talk contribs created page Talk:1 (Created page with "==Computational class== This is actually likely Turing complete since <code>*</code> can both multiply and divide. See counter machine. ~~~~")
• 02:16, 7 March 2025 Stkptr talk contribs created page Talk:Hexagon says jump to line a if cell b is n and increment cell b by c if cell b equals d and output cell b is cell b equals e. (Created page with "==Computational class== Only a finite amount of cells can be referenced in a finite program. Assuming unbounded cells and the increment argument is nonnegative, cells can never decrease in value. If cells are unbounded and can be decremented then this should be Turing complete by reduction from counter machines. Otherwise, this can only represent finite state machines. ~~~~")
• 00:04, 13 May 2024 Stkptr talk contribs created page Gregušová-Korec universal Minsky machine (Create unfinished page)
• 17:31, 7 May 2024 Stkptr talk contribs moved page Talk:Universal Machine to Talk:Universal machine (Match casing convention)
• 17:31, 7 May 2024 Stkptr talk contribs moved page Universal Machine to Universal machine (Match casing convention)