Theories of computability / by Nicholas Pippenger

By: Pippenger, NicholasMaterial type: Text

TextLanguage: English Publication details: New York: Cambridge University Press, 1997. Description: ix, 251pISBN: 0521553806Subject(s): Automata | Computability | Logical expressions | MathDDC classification: 511.3

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Date due	Barcode
Books	PROF. BHUBANESWAR BEHERA CENTRAL LIBRARY	511.3 PIP/T (Browse shelf(Opens below))	Available		114313

Previous	No cover image available							Next
Previous	511.3 KOL/D Discrete mathematical structures	511.3 MAO/T To Infinity and Beyond A Cultural History of the Infinite	511.3 PET/R Recursive functions in computer theory	511.3 PIP/T Theories of computability	511.3 POL/H How To Solve It : A New Aspect Of Mathematical Method	511.3 SHI/A An introduction to automata theory	511.3 SHO/M Mathematical logic	Next

There are no comments on this title.

to post a comment.