About: Iterated logarithm   Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

The iterated logarithm \(\log^* x\) is defined as the number of iterations of \(\log x\) needed to reach a number less than 1. It is used in computational complexity theory; there are algorithms known to have time complexity \(O(\log^* n)\). \(\log^*\) is so slow-growing that such algorithms practically run in constant time. This article is a . You can help My English Wiki by expanding it.

AttributesValues
rdfs:label
  • Iterated logarithm
rdfs:comment
  • The iterated logarithm \(\log^* x\) is defined as the number of iterations of \(\log x\) needed to reach a number less than 1. It is used in computational complexity theory; there are algorithms known to have time complexity \(O(\log^* n)\). \(\log^*\) is so slow-growing that such algorithms practically run in constant time. This article is a . You can help My English Wiki by expanding it.
sameAs
dcterms:subject
dbkwik:googology/p...iPageUsesTemplate
abstract
  • The iterated logarithm \(\log^* x\) is defined as the number of iterations of \(\log x\) needed to reach a number less than 1. It is used in computational complexity theory; there are algorithms known to have time complexity \(O(\log^* n)\). \(\log^*\) is so slow-growing that such algorithms practically run in constant time. This article is a . You can help My English Wiki by expanding it.
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software