User contributions for Hsjoihs

3 June 2026

• 23:5523:55, 3 June 2026 diff hist 0 m Fractran →BBf(15) Family: Using the variable name "n" here is misleading (since another variable named "n" is set equal to 2 in the paragraph immediately preceding it)

10 July 2024

• 13:2613:26, 10 July 2024 diff hist +968 N Quasihalt Created page with "A program is called '''quasihalting''' if it has any states which are reached no more than a fixed number of times during the course of a computation.<ref>https://www.sligocki.com/2021/03/06/beeping-busy-beaver/</ref> A machine is said to '''quasihalt''' when it ''enters'' a cycle of behavior in which it does not visit all machine states.<ref>https://nickdrozd.github.io/2020/10/08/quasihalting-behavior.html</ref><ref>https://discord.com/channels/960643023006490684/10265..." current
• 13:1413:14, 10 July 2024 diff hist +8 m Cryptids Make "probviously" and "quasihalt" into links Tag: Visual edit: Switched
• 12:3912:39, 10 July 2024 diff hist +49 N Standard TM Text format Redirected page to Turing machine#Standard text format current Tag: New redirect
• 12:3812:38, 10 July 2024 diff hist +49 N Standard text format Redirected page to Turing machine#Standard text format current Tag: New redirect
• 12:2212:22, 10 July 2024 diff hist +11 m Beeping Busy Beaver Not $, but <math> Tag: Visual edit: Switched
• 12:2112:21, 10 July 2024 diff hist +55 m Beeping Busy Beaver Not $, but <math> Tag: Visual edit: Switched
• 12:2012:20, 10 July 2024 diff hist +1,101 N Beeping Busy Beaver Created page with "A Beeping Busy Beaver (BBB) is a concept defined on a ''beeping Turing machine'', which is a Turing machine that has a special state named "beep state". The goal of a BBB is as follows: when starting from a totally blank tape, we want the final beep to happen as late as possible. The phrasing "final beep" means that the machine must beep finitely many times. Formally, we define the $n$^th Beeping Busy Beaver number as <math display="block">\operatorname{BBB}(..."
• 11:5411:54, 10 July 2024 diff hist −1 m 1RB2LC1RC 2LC---2RB 2LA0LB0RA Removing the space after the comma when in the main text (but not when it is a citation), adhering to https://discord.com/channels/960643023006490684/1249351319756607619/1260560590192115764 Tag: Visual edit: Switched
• 11:5411:54, 10 July 2024 diff hist −1 m Bigfoot Removing the space after the comma when in the main text (but not when it is a citation), adhering to https://discord.com/channels/960643023006490684/1249351319756607619/1260560590192115764 Tag: Visual edit: Switched
• 11:5111:51, 10 July 2024 diff hist −3 m Collatz-like Removing the space after the comma when in the main text (but not when it is a citation), adhering to https://discord.com/channels/960643023006490684/1249351319756607619/1260560590192115764 Tag: Visual edit: Switched
• 11:4911:49, 10 July 2024 diff hist −3 m Cryptids Removing the space after the comma when in the main text (but not when it is a citation), adhering to https://discord.com/channels/960643023006490684/1249351319756607619/1260560590192115764 Tag: Visual edit: Switched
• 08:3408:34, 10 July 2024 diff hist +401 BB(4) Add the Allen Brady's dissertation of 1965 Tag: Visual edit: Switched
• 08:0408:04, 10 July 2024 diff hist +976 N BB(4) Created page with "'''BB(4)''' refers to the 4^th value of the Busy Beaver function. == History == In this Section, we use Radó's original S (number of steps) and Σ (number of ones on the final tape) notations; see Busy Beaver Functions. * In 1966, Allen Brady conjectures Σ(4) = 13 and S(4) = 106.<ref name=":1">Brady, A. H. (1966). The Conjectured Highest Scoring Machines for Rado's Σ(k) for the Value k = 4. https://ieeexplore.ieee.org/document/4038890 </ref> * In..." Tag: Visual edit: Switched
• 07:4707:47, 10 July 2024 diff hist +1 m Tree Normal Form Fix typo: programatic → programmatic Tag: Visual edit
• 07:4507:45, 10 July 2024 diff hist −1 m Tree Normal Form Fix typo: it's → its Tag: Visual edit