Re: Is "infinite processes" allowed in algorithm for construction?
From: Michael N. Christoff (mchristoff_at_sympatico.caREMOVETHIS)
Date: 07/16/04
- Next message: Kenneth Doyle: "Re: whether economics is zero-sum Re: Properties of VonNeumann games of minimax theorem; proving chessis a draw OS"
- Previous message: Jimmy Mc Laughlin: "Certain sum of legendre symbols"
- In reply to: H. Shinya: "Is "infinite processes" allowed in algorithm for construction?"
- Next in thread: mareg_at_mimosa.csv.warwick.ac.uk: "Re: Is "infinite processes" allowed in algorithm for construction?"
- Reply: mareg_at_mimosa.csv.warwick.ac.uk: "Re: Is "infinite processes" allowed in algorithm for construction?"
- Messages sorted by: [ date ] [ thread ]
Date: Thu, 15 Jul 2004 22:15:24 -0400
""H. Shinya"" <erdosfan@yahoo.com> wrote in message
news:200407151637.i6FGblR14486@proapp.mathforum.org...
> Is it allowed that in algorithm for constructing something (any
geometrical objects, for example) one includes "do --- indefinitely"?
>
> H. Shinya
>
By definition, a formal algorithm must complete in a finite amount of time
(steps). However, many common computer applications are not technically
algorithms because they often a) are long lived processes (ie: may 'run
indefinitely' like http server daemons), b) they interact with the external
environment after they have started (ie: word processor).
l8r, Mike N. Christoff
- Next message: Kenneth Doyle: "Re: whether economics is zero-sum Re: Properties of VonNeumann games of minimax theorem; proving chessis a draw OS"
- Previous message: Jimmy Mc Laughlin: "Certain sum of legendre symbols"
- In reply to: H. Shinya: "Is "infinite processes" allowed in algorithm for construction?"
- Next in thread: mareg_at_mimosa.csv.warwick.ac.uk: "Re: Is "infinite processes" allowed in algorithm for construction?"
- Reply: mareg_at_mimosa.csv.warwick.ac.uk: "Re: Is "infinite processes" allowed in algorithm for construction?"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
