from The American Heritage® Dictionary of the English Language, 4th Edition
- n. Mathematics The act of raising a quantity to a power.
from Wiktionary, Creative Commons Attribution/Share-Alike License
- n. The process of calculating a power by multiplying together a number of equal factors, where the exponent specifies the number of factors to multiply.
- n. A mathematical problem involving exponentiation.
from the GNU version of the Collaborative International Dictionary of English
- n. the process of raising a quantity to some assigned power.
from The Century Dictionary and Cyclopedia
- n. The act of affecting with an exponent or index.
from WordNet 3.0 Copyright 2006 by Princeton University. All rights reserved.
- n. the process of raising a quantity to some assigned power
Sorry, no etymologies found.
So in the special case when the order of is a power of 2, we can compute the order using only on exponentiation, which is computationally feasible for the orders of magnitude we are considering.
Here in one lovely equation are the five most important numbers in all of mathematics, and the three most fundamental operators: addition, multiplication, and exponentiation.
I actually put a caret up-arrow there to indiciate exponentiation.
So off I go to Google largest numbers and we are learning about googol, googolplex, Graham's number, large number notation, exponentiation, tetration.
Myhill justifies exponentiation by noting that a function is a rule, a finite object which can actually be given (contrary to infinite sets).
A form of exponentiation can also be found in constructive type theory.
Obviously no one here has heard of exponentiation or Ray Kurzweil Bill Gates' favourite futurologist.
As we saw, E was defined from the slowly growing function, Ï, using three applications of primitive recursion: one for addition, one for multiplication, and then one more for exponentiation.
The following are a few examples showing that addition, multiplication, and exponentiation are primitive recursive.
I discovered simple forms of repeated exponentiation and recursion for myself.
Wordnik is becoming a not-for-profit! Read our announcement here.