From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!rutgers!sun-barr!olivea!uunet!trwacs!erwin Thu Apr 16 11:34:19 EDT 1992
Article 5073 of comp.ai.philosophy:
Path: newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!rutgers!sun-barr!olivea!uunet!trwacs!erwin
>From: erwin@trwacs.fp.trw.com (Harry Erwin)
Newsgroups: comp.ai.philosophy
Subject: Re: Robert Rosen & Physical form of Church's Thesis
Message-ID: <539@trwacs.fp.trw.com>
Date: 11 Apr 92 21:29:14 GMT
References: <TogZiB1w164w@cybernet.cse.fau.edu> <1992Apr10.165224.11963@organpipe.uug.arizona.edu>
Organization: TRW Systems Division, Fairfax VA
Lines: 23

The question is asked--is a turbulent flow useful as an algorithm for
something?

1. There are enough algorithms that behave like a turbulent flow while
doing their thing, that you have to at least address whether the
turbulence is a problem.

2. Turbulent flows are a good starting point for phase-locking--they
include all periodicities.

3. A controlled system based on a turbulent flow is typically quite
maneuverable. 

4. Some processes need to be turbulent to avoid being too predictable.
Comms routing in some cases needs to be turbulent.

I've published a couple of papers on practical uses of turbulence. If you
want copies, send me a note.

Cheers,
-- 
Harry Erwin
Internet: erwin@trwacs.fp.trw.com


