User contributions for Qwerpiw

16:4416:44, 10 August 2025 diff hist −11‎ TMBR: August 2025 ‎No edit summary Tag: Visual edit
16:4116:41, 10 August 2025 diff hist +138‎ TMBR: August 2025 ‎No edit summary
16:3816:38, 10 August 2025 diff hist +1‎ TMBR: August 2025 ‎No edit summary Tag: Visual edit: Switched
16:3816:38, 10 August 2025 diff hist +363‎ N Template:Stub ‎ Created page with ":<div class="notice metadata plainlinks" id="stub">''This article is a stub. You can help the {{SITENAME}} by [{{fullurl:{{FULLPAGENAME}}|action=edit}} expanding it].''</div> <includeonly>Category:Stubs</includeonly><noinclude> ---- ''This template will categorize articles that include it into Category:Stubs.'' </noinclude>"

01:5301:53, 7 August 2025 diff hist +12‎ Terminating Turmite ‎No edit summary
01:5101:51, 7 August 2025 diff hist +114‎ N Talk:1RB1LE 1LC0RA 0RF0LD 1LE1LA 1RC0LB ---1RC ‎ Created page with "Turing machine for what function? ~~~~" current

19:0719:07, 6 August 2025 diff hist +40‎ Tₘ function ‎No edit summary current
19:0419:04, 6 August 2025 diff hist +27‎ N T M function ‎ Qwerpiw moved page T M function to Tₘ function current Tag: New redirect
19:0419:04, 6 August 2025 diff hist 0‎ m Tₘ function ‎ Qwerpiw moved page T M function to Tₘ function
18:4318:43, 6 August 2025 diff hist +944‎ N Tₘ function ‎ Created page with "Let M be a non-deterministic Turing machine which recognizes a language L, that is, for every input word u there is an accepting computation with input u if and only if u ∈ L. Let us assume that M terminates on every input. The simplest thing to assume is that if u ∈ L, the TM eventually gives "yes" and if u ∉ L, it gives "no". The smallest time (number of steps) of such a computation is denoted by T<sub>M</sub>(u) . For every n >= 1 we define T<sub>M</sub>(..." Tag: Visual edit: Switched
18:2518:25, 6 August 2025 diff hist +143‎ Sequences ‎No edit summary
18:1518:15, 6 August 2025 diff hist +43‎ TMBR: August 2025 ‎No edit summary
18:1418:14, 6 August 2025 diff hist +114‎ TMBR: August 2025 ‎No edit summary
18:1318:13, 6 August 2025 diff hist +70‎ Instruction-Limited Busy Beaver ‎No edit summary Tag: Visual edit

16:0116:01, 2 August 2025 diff hist +50‎ N TMBR: August 2025 ‎ Created page with "{{Stub}} this month in busy beaver for 2025 August" Tag: Visual edit

21:5021:50, 31 July 2025 diff hist +64‎ Doodle function ‎No edit summary
21:4321:43, 31 July 2025 diff hist +1,131‎ N Doodle function ‎ Created page with "The '''doodle function''' is a function made by Lawrence Hollom. It is a two-argument function.<ref>https://web.archive.org/web/20230901195926/https://sites.google.com/a/hollom.com/extremely-big-numbers/home/doodle-function</ref> == Definition == The function revolves around a specific type of one-dimensional cellular automaton, in which state of a cell is determined by its own state and state of the cell to its right at previous generation (Hollom's original explanatio..." Tag: Visual edit: Switched
21:2721:27, 31 July 2025 diff hist +4‎ TMBR: July 2025 ‎No edit summary Tag: Visual edit
21:2621:26, 31 July 2025 diff hist +107‎ TMBR: July 2025 ‎No edit summary Tag: Visual edit

01:2201:22, 19 July 2025 diff hist +538‎ User:Qwerpiw/List of BB functions ‎No edit summary current Tag: Visual edit
01:1601:16, 19 July 2025 diff hist +5,367‎ N User:Qwerpiw/List of BB functions ‎ Created page with "* Maximum space: Ben-Amram call this <math>space(n)</math><ref name=":0" />, bbchallenge calls it <code>BB_SPACE(n)</code> or <math>BB_{space}(n)</math>. This is the total number of tape cells read before halting. According to Ben-Amram, it includes the starting cell, but not necessarily the cell the halting transition moves to.<ref name=":0" /> * Maximum consecutive ones: Ben-Amram calls this <math>num(n)</math>.<ref name=":0" /> A..." Tag: Visual edit

Navigation menu