Newsgroups: comp.ai.neural-nets
Path: cantaloupe.srv.cs.cmu.edu!rochester!cornellcs!newsstand.cit.cornell.edu!news.kei.com!newsfeed.internetmci.com!news.sprintlink.net!redstone.interpath.net!sas!mozart.unx.sas.com!saswss
From: saswss@hotellng.unx.sas.com (Warren Sarle)
Subject: Re: REQ: Estimation function O(N)
Originator: saswss@hotellng.unx.sas.com
Sender: news@unx.sas.com (Noter of Newsworthy Events)
Message-ID: <DHwJ65.9rJ@unx.sas.com>
Date: Sat, 11 Nov 1995 23:13:17 GMT
X-Nntp-Posting-Host: hotellng.unx.sas.com
References:  <47scql$q3e@fstgal00.tu-graz.ac.at>
Organization: SAS Institute Inc.
Lines: 21


In article <47scql$q3e@fstgal00.tu-graz.ac.at>, GILLETTE@JOANNEUM.ADA.AT (Gillette Gillette) writes:
|> When people in the literature talk about the computation requirement of an
|> algorithm, they introduce a function
|>
|> O(x),
|>
|> where x=N or x=N*N or a ratio of N ...
|>       N is the dimensionality of the state vector.
|>
|> Is the symbol O() just used to indicate "is a function of ..." or is it a
|> known function (then which one) ?

A function f(N) is said to be O(x) if f(N)/x approaches a constant > 0
as N goes to infinity. f(N) is o(x) if f(N)/x approaches 0.

-- 

Warren S. Sarle       SAS Institute Inc.   The opinions expressed here
saswss@unx.sas.com    SAS Campus Drive     are mine and not necessarily
(919) 677-8000        Cary, NC 27513, USA  those of SAS Institute.
