All public logs

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

• 13:26, 10 July 2024 Hsjoihs talk contribs created page 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...")
• 12:39, 10 July 2024 Hsjoihs talk contribs created page Standard TM Text format (Redirected page to Turing machine#Standard text format) Tag: New redirect
• 12:38, 10 July 2024 Hsjoihs talk contribs created page Standard text format (Redirected page to Turing machine#Standard text format) Tag: New redirect
• 12:20, 10 July 2024 Hsjoihs talk contribs created page 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}(...")
• 08:04, 10 July 2024 Hsjoihs talk contribs created page 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:42, 10 July 2024 User account Hsjoihs talk contribs was created