Computation and Automata

Cambridge University Press (1985)
Abstract
This introduction to certain mathematical topics central to theoretical computer science treats computability and recursive functions, formal languages and automata, computational complexity, and cruptography. The presentation is essentially self-contained with detailed proofs of all statements provided. Although it begins with the basics, it proceeds to some of the most important recent developments in theoretical computer science.
Keywords Computable functions  Computational complexity  Sequential machine theory
Categories (categorize this paper)
Buy the book $14.99 used (92% off)   $54.99 new (36% off)   $75.66 direct from Amazon (11% off)    Amazon page
Call number QA9.59.S25 1985
ISBN(s) 0521177332   0521302455   9780521302456
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,449
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA

No citations found.

Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

12 ( #130,771 of 1,103,223 )

Recent downloads (6 months)

4 ( #85,078 of 1,103,223 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.