User:CompactStar/Super-pitch: Difference between revisions
Mark term as i |
Credit CompactStar for name proposal |
||
| Line 4: | Line 4: | ||
The super-logarithm is traditionally defined the number of times a logarithm must be iterated to get to 1. For example, slog<sub>b</sub>(1) = 0, slog<sub>b</sub>(b) = 1, slog<sub>b</sub>(b<sup>b</sup>) = 2, slog<sub>b</sub>(b<sup>b<sup>b</sup></sup>) = 3, and so on. This definition only allows for inputs of the form 1, b, b<sup>b</sup>, b<sup>b<sup>b</sup></sup>, etc., although there are various continuous extensions of it for other outputs (most commonly the linear and quadratic approximations, as mentioned on the Wikipedia article) which have differing definitions. | The super-logarithm is traditionally defined the number of times a logarithm must be iterated to get to 1. For example, slog<sub>b</sub>(1) = 0, slog<sub>b</sub>(b) = 1, slog<sub>b</sub>(b<sup>b</sup>) = 2, slog<sub>b</sub>(b<sup>b<sup>b</sup></sup>) = 3, and so on. This definition only allows for inputs of the form 1, b, b<sup>b</sup>, b<sup>b<sup>b</sup></sup>, etc., although there are various continuous extensions of it for other outputs (most commonly the linear and quadratic approximations, as mentioned on the Wikipedia article) which have differing definitions. | ||
There is, notably, one extension for complex numbers developed by Kneser, which so far seems the best when implemented to the reals. | There is, notably, one extension for complex numbers developed by Kneser, which so far seems the best when implemented to the reals. | ||
The term "super-pitch" was proposed by [[User:CompactStar|CompactStar]]. | |||
== "Super-pitch equivalents" of different concepts == | == "Super-pitch equivalents" of different concepts == | ||