-
Notifications
You must be signed in to change notification settings - Fork 46
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
find operators that are stronger than pow but weaker than pentation (then implement them) #15
Comments
Maybe we could find inspiration in big O notation and ordinal collapsing functions/fast growing hierarchies/slow hierarchies, which are basically the language for describing how fast functions grow. https://oeis.org/wiki/Growth_of_sequences https://en.wikipedia.org/wiki/Big_O_notation http://googology.wikia.com/wiki/Fast-growing_hierarchy / http://googology.wikia.com/wiki/Slow-growing_hierarchy / http://googology.wikia.com/wiki/Introduction_to_ordinal_collapsing_functions |
I had considered a sort of loglift but it behaved weird. essentially i was doing 10^(log10(num1)*log10(num2)) for a multiplication and increase the amount of logs as needed. other solutions I had is operations on the top exponent directly. but both solutions lacks of smooth transitions. |
Ideas: Basic layer X logarithm operators. For Examples: |
https://sites.google.com/site/pointlesslargenumberstuff/home/2/weakoperators is an interesting article that describes 'Weak' Hyperoperators. So called 'Strong' Tetration and Pentation evaluates right to left so as to get the most massive numbers, but the 'Weak' hyper operators go left to right and get results that grow slower. It takes about two 'Weak' hyperoperators to match the boost from one 'Strong' hyperoperator, so:
http://mrob.com/pub/math/hyper4.html#lower4 MROB also explores weak tetration, and even explains how to compute weak sroot and weak slog (the two inverse operators). Cool! |
https://math.blogoverflow.com/tag/super-square-root/ Since I don't have a better place to put this, identities and growth rate for tetration. https://andydude.github.io/tetration/archives/tetration2/ident.html Some more. |
random idea would be: you could slog both numbers, then do some math on the slogs, then base 10 tetrate them back into hueg numbers. but then aren't you just doling linear operations and making it look superexponential, kind of like how true exponential eventually just has a level that's 'your number, as an exponent'? maybe, but if you mix math-on-slogs and normal operations maybe something interesting could come out of it. |
articles on fractional hyperoperators, since I think for the most part it does come down to 'can we define operators with non-integer rank, since anything else is just combinations of existing operators rather than a fundamentally new one': https://www.hindawi.com/journals/mpe/2016/4356371/ Fractional Mathematical Operators and Their Computational Approximation |
exponential factorial |
pow and tetration are 'boring' for reaching higher layers in the sense that they just count up layers one at a time past a certain point - everything devolves into min, max, cmp, succ and add operations. but pentation is way too strong, lacks research into non-integer arguments and explodes way too rapidly for even tiny integers.
what would be some kind of in-between operator that e.g. a crazy incremental game could use to surge up the layers to 1^^1.8e308?
real numbered hyper operators > 3 and < 5? (0 is successor, 1 is add, 2 is mul, 3 is pow, 4 is tetrate, 5 is pentate.)
functions arbitrarily crafted to have approximately hyper operator >= 0 <= 3 strength behaviour on the layers of their arguments, with magnitudes interpreted as partial layers?
The text was updated successfully, but these errors were encountered: