Computability Theory: An Introduction for Students of Computer Science

Simple item page
dc.contributor.authorKang, Andy N. C.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:43Zen
dc.date.available2013-06-19T14:36:43Zen
dc.date.issued1975en
dc.description.abstractThe primary goal of this book is to introduce the basic concepts of effective computability and to prepare the reader for the study of formal language theory, recursive function theory, and the theory of computational complexity.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000806/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000806/01/CS75030-R.pdfen
dc.identifier.trnumberCS75030-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20280en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleComputability Theory: An Introduction for Students of Computer Scienceen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS75030-R.pdf
Size:
1.86 MB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports