Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!linus!decvax!decwrl!glacier!kestrel!ladkin
From: ladkin@kestrel.ARPA (Peter Ladkin)
Newsgroups: net.cse
Subject: Re:  CS degrees, are they useful?
Message-ID: <5126@kestrel.ARPA>
Date: Mon, 24-Feb-86 19:11:13 EST
Article-I.D.: kestrel.5126
Posted: Mon Feb 24 19:11:13 1986
Date-Received: Wed, 26-Feb-86 07:29:44 EST
References: <6350@cca.UUCP>
Organization: Kestrel Institute, Palo Alto, CA
Lines: 19

In article <6350@cca.UUCP>, g-rh@cca.UUCP (Richard Harter) writes:
> [curriculum for a CS degree]
> EE/MATH: Statistical theory of communication and linear systems.
> Math:  Calculus, advanced calculus for engineers, linear algebra,
> mathematical statistics (the hard core stuff, not "statistics for
> grade school teachers"), and numerical analysis.

This would be almost entirely useless to anyone but a numerical
analyst.
What about propositional and predicate calculus, complexity
theory (concrete and asymptotic), graph theory, combinatorics,
some universal algebra (plus a bit of groups, rings and fields
for concreteness), Boolean algebra, relational algebra, model
theory, theory of computation, theory of formal languages,
recursion theory (Turing machines, recursive functions),
lambda calculus and denotational semantics?
Or did you forget these?

Peter Ladkin