From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=0.8 required=5.0 tests=BAYES_05,FREEMAIL_FROM,
	FROM_STARTS_WITH_NUMS,INVALID_MSGID autolearn=no autolearn_force=no
	version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,fd4efc6975b38cf6,start
X-Google-Attributes: gid103376,public
From: Chuck Ebbert <76306.1226@CompuServe.COM>
Subject: Re: Math for Computer Science
Date: 1995/04/22
Message-ID: <3nc1sv$3q7$1@mhadg.production.compuserve.com>#1/1
X-Deja-AN: 101233946
organization: via CompuServe Information Service
newsgroups: comp.lang.ada
Date: 1995-04-22T00:00:00+00:00
List-Id: <comp.lang.ada>

 An excellent intro to 'Math for Computer Science' is A.K. Dewdney's 'The
New Turing Omnibus' (ISBN 0-7167-8271-5).
 
 It covers Turing machines, NP-complexity, Goedel's Theorem, and lots of
other related topics. The best part is that it's divided up into 66 short
chapters that can be read pretty much independently of each other, which
makes it great for browsing. It's also written so that an 'average' person
can read and understand it.
 
-- Chuck Ebbert  76306.1226@compuserve.com
--
-- In cyberspace, nobody can smell your breath.