ScratchData LogoScratchData
Back to REDACTED2000's profile

IMPOSSIBLE... WHY...

REREDACTED2000•Created August 8, 2024
IMPOSSIBLE... WHY...
1
1
60 views
View on Scratch

Instructions

PL: TRUE RAYO((TREE(BB(BB((TREE((TREE((TREE((TREE(RAYO(10^100))))))))TH GATE can bypass: power disabling one-tapps butchers (hits that deal over TREE(RAYO(500)) damage) cheats spells magic deterioration

Description

incomprehendible value meanings Busy Beaver: The nth busy beaver number, denoted BB(n), is the maximum finite number of state shifts undergone by a halt-state Turing machine with n non- accept/reject states and the alphabet {0, 1}. Here, we require that each halt-state TM under consideration actually halts (i.e., does not loop indefinitely) Rayo's number: The smallest number bigger than any number that can be named by an expression in the language of first order set-theory with less than a googol (10^100) symbols. What follows is an introduction in Knuth's up-arrow notation, a method used in notation of very large numbers.

Project Details

Project ID1053699970
CreatedAugust 8, 2024
Last ModifiedAugust 10, 2024
SharedAugust 8, 2024
Visibilityvisible
CommentsAllowed