Author: Dann Corbit
Date: 15:16:48 05/09/01
Some people are insisting that finite inputs mean O(1). My insistence is that the big-O behavior should model the difference from n to n+1 and from n to n-1 (past some point n0). There are no real algorithms with infinite inputs. These so-called algorithms can never terminate. Because we cannot agree on definitions we can never come to an agreement. My definitions are the classiscal defintions used in all the literature. The alternative definitions make for interesting debate, but since they have no value at predictions, they have no practical value.
This page took 0.01 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.