Search results
Jump to navigation
Jump to search
- ...le H(n)\equiv n+\big\lfloor\frac{1}{2}n\big\rfloor=\Big\lfloor\frac{3}{2}n\Big\rfloor=\begin{cases} ...+1}t\big)=H^s(2^s\cdot3t)=3^{s+1}t</math> and <math>H^{s+1}\big(2^{s+1}t+1\big)=H^s(2^s\cdot3t+1)=3^{s+1}t+1</math>. Therefore, by mathematical induction ...10 KB (1,616 words) - 08:48, 8 October 2025
- The <math>f_\omega</math> mechanism operates on lists of numbers, and simulates the rule ...& \to & D\big(n_1,\frac{n_0}{2}+47\big) & \to & D\Big(n_2,\frac{n_0+98}{3}\Big) & \to \\ ...7 KB (1,339 words) - 17:27, 20 October 2026
- ...ult, we can apply this rule <math display="inline">\big\lfloor\frac{1}{2}b\big\rfloor-1</math> times (assuming <math>b\ge 4</math>), which creates two pos ...;0^\infty</math>, equal to <math display="inline">A\Big(a+2,\frac{3}{2}b+2\Big)</math>, <math display="inline">\frac{3}{2}b</math> steps later. This gives ...15 KB (2,362 words) - 01:41, 9 May 2026
- ...2.txt Link])</ref> Their runtimes are expressed using an [[Measuring large numbers#Knuth's up-arrow notation|extension]] of [[wikipedia:Knuth's_up-arrow_notat C(4k) & \to & {\operatorname{Halt}}\Big(\frac{3^{k+3} - 11}{2}\Big) \\ ...16 KB (2,521 words) - 11:33, 15 November 2026
- ...periments.pdf slides]) at the [https://www.newton.ac.uk/event/bprw03/ 2025 Big Proof workshop]. The talk is about the [https://teorth.github.io/equational ...nce/math/a65357535/busy-beaver-six/ Mathematicians Say There’s a Number So Big, It’s Literally the Edge of Human Knowledge]. ...18 KB (2,390 words) - 15:04, 19 April 2026
- ...ef> In this model a program is simply a finite list of fractions (rational numbers), the program state is an integer. For more details see https://en.wikipedi A Fractran program is a list of rational numbers <math>[q_0, q_1, \dots, q_{k-1}]</math> called rules and a Fractran state i ...42 KB (4,717 words) - 17:40, 15 November 2026