Eventual domination is a relation describing the asymptotic behavior of two functions. The function \(f\) is said to eventually dominate \(g\) if \(f(n) > g(n)\) for all sufficiently large \(n\). That is, \(f\) asymptotically outgrows \(g\). Over \(\mathbb{N} ightarrow \mathbb{N}\), eventual domination is transitive relation. It is not total, since we can construct two different functions such that neither eventually dominates the other. This relation is however antisymmetric, and extending the relation to "\(f(n)\) eventually dominates \(g(n)\) or \(f(n)=g(n)\)" gives rise to a partial order.
| Attributes | Values |
|---|
| rdfs:label
| |
| rdfs:comment
| - Eventual domination is a relation describing the asymptotic behavior of two functions. The function \(f\) is said to eventually dominate \(g\) if \(f(n) > g(n)\) for all sufficiently large \(n\). That is, \(f\) asymptotically outgrows \(g\). Over \(\mathbb{N} ightarrow \mathbb{N}\), eventual domination is transitive relation. It is not total, since we can construct two different functions such that neither eventually dominates the other. This relation is however antisymmetric, and extending the relation to "\(f(n)\) eventually dominates \(g(n)\) or \(f(n)=g(n)\)" gives rise to a partial order.
- Eventual domination is a relation describing the asymptotic behavior of two functions. The function is said to eventually dominate iff for all sufficiently large . That is, asymptotically outgrows . Theorems of the form " eventually dominates every function with property " are useful in formally giving a sense of scale for fast-growing functions. A common choice for is the property of being provably recursive in certain formal theory, like Peano arithmetic or ZFC. In hypercomputable scenarios, can be the property of being computable within a system such as Turing machines.
|
| dcterms:subject
| |
| dbkwik:googology/p...iPageUsesTemplate
| |
| abstract
| - Eventual domination is a relation describing the asymptotic behavior of two functions. The function is said to eventually dominate iff for all sufficiently large . That is, asymptotically outgrows . Theorems of the form " eventually dominates every function with property " are useful in formally giving a sense of scale for fast-growing functions. A common choice for is the property of being provably recursive in certain formal theory, like Peano arithmetic or ZFC. In hypercomputable scenarios, can be the property of being computable within a system such as Turing machines. Over , eventual domination is transitive relation. It is not total, since we can construct two different functions such that neither eventually dominates the other. This relation is however antisymmetric, and extending the relation to " eventually dominates or " gives rise to a partial order.
- Eventual domination is a relation describing the asymptotic behavior of two functions. The function \(f\) is said to eventually dominate \(g\) if \(f(n) > g(n)\) for all sufficiently large \(n\). That is, \(f\) asymptotically outgrows \(g\). Theorems of the form "\(f\) eventually dominates every function with property \(P\)" are useful in formally giving a sense of scale for fast-growing functions. A common choice for \(P\) is the property of being provably recursive in certain formal theory, like Peano arithmetic or ZFC. In hypercomputable scenarios, \(P\) can be the property of being computable within a system such as Turing machines. Over \(\mathbb{N} ightarrow \mathbb{N}\), eventual domination is transitive relation. It is not total, since we can construct two different functions such that neither eventually dominates the other. This relation is however antisymmetric, and extending the relation to "\(f(n)\) eventually dominates \(g(n)\) or \(f(n)=g(n)\)" gives rise to a partial order.
|
| is growthrate
of | |
![[RDF Data]](/fct/images/sw-rdf-blue.png)