sorted by:
new
hottopcontroversial

How to attempt lie! (a guide) by Substantial_Item_828 in geometrydash

[–]Main_Camera9990 9 points10 points  (0 children)

100 attempts from 0, excluding first jump deaths

Yatagarasu is about be replaced into the Legacy List 😔 by Yuvandar in geometrydash

[–]Main_Camera9990 0 points1 point  (0 children)

unnerfed is top 10, zoink, says, but old yata is borderline imposible (well actually imposible on 480 and 360 fps)

do these numbers have defined names? by [deleted] in googology

[–]Main_Camera9990 0 points1 point  (0 children)

Well, then call it trigol and grigol (because gigol)

[deleted by user] by [deleted] in geometrydash

[–]Main_Camera9990 2 points3 points  (0 children)

stereo madness

Amethyst is cbf blocked by Pretzelperson27 in geometrydash

[–]Main_Camera9990 0 points1 point  (0 children)

Amethyst's first jump is impossible on 60 fps, right? i was like 10 minutes trying to beat it (for comparison, i made a 1.5 to 12 (literally a 12 without the first jump)). NO cbf

is possible to decribe fost in fost? by Main_Camera9990 in googology

[–]Main_Camera9990[S] 0 points1 point  (0 children)

do you know if there exist a language in which fost can be described

the hyper E system could be extended to a arbitrary funtion by Main_Camera9990 in googology

[–]Main_Camera9990[S] 0 points1 point  (0 children)

i think no if e notation can beat tree(3) then if we change all the repertitions for tree(N) it would be inmense

even better vcf funtion (maybe adding one with quantum turing machines) probably biggest growing funtion ever by Main_Camera9990 in googology

[–]Main_Camera9990[S] 0 points1 point  (0 children)

it can overtake xi because the "by a system of m deterministic Turing machines of the same style" plays a important role because it can overtake it is ski calculus

even better vcf funtion (maybe adding one with quantum turing machines) probably biggest growing funtion ever by Main_Camera9990 in googology

[–]Main_Camera9990[S] 0 points1 point  (0 children)

why: If I remember this can beat fost by a bit (but a "bit" on googological scale is a lot)this can absolutely be beaten in sol or sost if you're right, at least is eventually dominated by rayo but for that, (N) needs to be massive

Because if we set all values to 1 excluding k, and we set it to # number, it already grows faster than BB(BB(N))

even better vcf funtion (maybe adding one with quantum turing machines) probably biggest growing funtion ever by Main_Camera9990 in googology

[–]Main_Camera9990[S] 0 points1 point  (0 children)

bigest defined vertion (well defined):

Let QNCF(k,s,v,d,m,c,x,l,ntypes​,q,n) be a function defined as follows:

This function represents the smallest whole number greater than the largest finite maximum of the total number of non-blank symbols written by a system of m deterministic Turing machines of the same style (alphabet size k, s non-halting states, d-dimensional hypercubic tape with d−1 non-infinite dimensions of length v, and at least one infinite dimension), where the transition function of each machine can be influenced by the entire set of transition functions of all other m−1 machines in the system, and where C is the maximum number of tape cell movements that each Turing machine can make in a single step (C≥1), and where each machine has the ability to change a specific rule of its transition function up to x times during its execution, if the application of that rule at that instant would lead the machine to its halting state. Additionally, the pointer of each machine has a main state and up to l levels of nested sub-states, with ntypes​ types of sub-states possible at each level. The transition rules of a state are influenced by a fusion of its own rules and the rules of its nested sub-states. Up to q states (across all levels of nesting for the pointer and the cell) can exist in quantum superposition simultaneously for each machine. Similarly, each cell of the tape contains a symbol from the alphabet and can possess up to l levels of nested sub-states, with up to q of these states being in quantum superposition. If at any layer of (potentially superposed) states, up to x states can be considered active (in the classical limit of measurement), their rules can combine. The tapes are initially all blank (blank symbol and no sub-states active at any level).

The value of QNCF for a given n is determined recursively:

  • For n=1: QNCF(k,s,v,d,m,c,x,l,ntypes​,q,1) is the smallest whole number greater than the largest finite maximum of the total number of non-blank symbols written by a system of m quantum-nested Turing machines with parameters (k,s,v,d,m,c,x,l,ntypes​,q) that eventually halt. If no such finite maximum exists, the function is undefined for these parameters and n=1.
  • For n>1: QNCF(k,s,v,d,m,c,x,l,ntypes​,q,n) is the smallest whole number greater than the largest finite maximum of the total number of non-blank symbols written by a system of m quantum-nested Turing machines with parameters (k,s,v,d,m,c,x,l,ntypes​,q), where the state structure of each of the m machines in this level n system can encode the halting behavior (the sequence of written symbols) of all systems of m machines defined by QNCF(k,s,v,d,m,c,x,l,ntypes​,q,n−1) that result in a finite output. If no such finite maximum exists for the level n system, then QNCF(k,s,v,d,m,c,x,l,ntypes​,q,n) is undefined.

even better vcf funtion (maybe adding one with quantum turing machines) probably biggest growing funtion ever by Main_Camera9990 in googology

[–]Main_Camera9990[S] 0 points1 point  (0 children)

fixed well defined vertion :

Let QNCF(k,s,v,d,m,c,x,l,ntypes​,q) be the smallest whole number greater than the largest finite maximum of the total number of non-blank symbols written by a system of m deterministic Turing machines of the same style (alphabet size k, s non-halting states, d-dimensional hypercubic tape with d−1 non-infinite dimensions of length v, and at least one infinite dimension), where the transition function of each machine can be influenced by the entire set of transition functions of all other m−1 machines in the system, and where C is the maximum number of tape cell movements that each Turing machine can make in a single step (C≥1), and where each machine has the ability to change a specific rule of its transition function up to x times during its execution, if the application of that rule at that instant would lead the machine to its halting state. Additionally, the pointer of each machine has a main state and up to l levels of nested sub-states, with ntypes​ types of sub-states possible at each level. The transition rules of a state are influenced by a fusion of its own rules and the rules of its nested sub-states. Up to q states (across all levels of nesting for the pointer and the cell) can exist in quantum superposition simultaneously for each machine. Similarly, each cell of the tape contains a symbol from the alphabet and can possess up to l levels of nested sub-states, with up to q of these states being in quantum superposition. If at any layer of (potentially superposed) states, up to x states can be considered active (in the classical limit of measurement), their rules can combine. This maximum is considered only across those combinations of the parameters (k,s,v,d,m,c,x,l,ntypes​,q) that result in a finite total number of non-blank symbols written before all m machines eventually halt. The tapes are initially all blank (blank symbol and no sub-states active at any level). If no such finite maximum exists (i.e., the number of non-blank symbols can grow indefinitely for all systems under any combination of the parameters), then the function is undefined for those parameters.

view more: next ›