Path: utzoo!mnetor!tmsoft!torsqnt!jarvis.csri.toronto.edu!rutgers!mit-eddie!uw-beaver!uw-june!peterd
From: peterd@cs.washington.edu (Peter C. Damron)
Newsgroups: comp.software-eng
Subject: Re: CS education [engineering, mathematics, and computer science]
Message-ID: <9924@june.cs.washington.edu>
Date: 24 Nov 89 17:31:33 GMT
References: <2608@fai.UUCP> <34818@regenmeister.uucp>
Reply-To: peterd@june.cs.washington.edu (Peter C. Damron)
Organization: University of Washington, Computer Science, Seattle
Lines: 28

In article <34818@regenmeister.uucp> chrisp@regenmeister.uucp (Chris Prael) writes:
>From article <2608@fai.UUCP>, by kurtl@fai.UUCP (Kurt Luoto):
>> I would also mention computability and complexity
>> theory and numerical analysis as branches of mathematics which are
>> fundamental to computing in general.

>2. Computability is a topic of numerical analysis.  A part of an
>application.

Computability and complexity theory is unrelated to numerical analysis.
Complexity theory is the study of what is computable and how difficult
things are to compute.  Complexity theory is fundamental to computer science.
Numerical analysis is the study of the computation of numerical quantities
using finite precision arithmetic.

Anyone who is not aware of the applications of complexity theory
can hardly call themselves a software engineer.

Peter.

---------------
Peter C. Damron
Dept. of Computer Science, FR-35
University of Washington
Seattle, WA  98195

peterd@cs.washington.edu
{ucbvax,decvax,etc.}!uw-beaver!uw-june!peterd