Computer Chess Club Archives

Search

Messages

Subject: Re: Chess and O(1)

Author: Dann Corbit

Date: 14:44:54 05/09/01

Go up one level in this thread

On May 09, 2001 at 17:23:38, Ricardo Gibert wrote:
[snip]
>The definition of big-O limits itself to where n is unbounded. To use the
>definition, n must be unbounded or at least assumed to be. We can make use of
>big-O by instantiating n, but this should not be confused with n being a
>constant to begin with."

Please provide a reference other than 'Ricardo Gibert' which forces this
requirement.  No real algorithm has unbounded input.

No algorithm can (for instance) operate on the set of integers.  Only on a
subset such as 'int' or 'long'.  Algorithms such as you describe do not exist
and if they did exist they would not be useful.

• Re: Chess and O(1) Ricardo Gibert 15:27:45 05/09/01
  • Re: Chess and O(1) Dann Corbit 15:30:36 05/09/01
    • Re: Chess and O(1) Ricardo Gibert 15:52:08 05/09/01
      • Re: Chess and O(1) Dann Corbit 15:56:35 05/09/01

This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.