Author: Ricardo Gibert
Date: 15:52:08 05/09/01
Go up one level in this thread
On May 09, 2001 at 18:30:36, Dann Corbit wrote: >On May 09, 2001 at 18:27:45, Ricardo Gibert wrote: >[snip] >>Algorithms can assume unbounded input. Programs operate on bounded input. You >>need to get the distinction clear in your mind if are going to be able to >>understand what is going on. >> >>Unbounded does not mean infinite. > >What is the value of your definition then? It cannot be used to calculate the >running time of algorithms. Your definition is simply pointless. An unbounded vaiable can be instantiated. This is what you do when you "plug in" numbers into an equation. A person can't understand a mathematical definition properly, if they don't understand when a variable is bounded or not. > >Analysis of algorithms is entirely for the purpose of estimation of running >time. Running time, number of steps, space usage, etc. These are not all the same.
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.