Your search returned 10 results.

Results
	1.	Automata and computability by Kozen, Dexter, 1951- Series: Undergraduate texts in computer science Material type: Text; Format: print ; Literary form: Not fiction Publication details: New York : Springer, c1997 Online access: Publisher description Table of contents only Availability: Items available for loan: IIITD (1)Call number: REF 511.3 KOZ-A. Place hold Add to cart (remove)
	2.	Automata, computability and complexity : theory and applications by Rich, Elaine Material type: Text; Format: print ; Literary form: Not fiction Publication details: New Delhi : Pearson, c2008 Availability: Items available for loan: IIITD (2)Call number: REF 511.3 RIC-A, ... Place hold Add to cart (remove)
	3.	The undecidable : basic papers on undecidable propositions, unsolvable problems and computable functions by Davis, Martin Material type: Text; Format: print ; Literary form: Not fiction Publication details: New York : Dover Publications, ©1965 Availability: Items available for loan: IIITD (1)Call number: REF 512.8 DAV-U. Place hold Add to cart (remove)
	4.	Theory of computation by Tourlakis, George J Material type: Text; Format: print ; Literary form: Not fiction Publication details: Hoboken, N.J. : Wiley, 2012 Availability: Items available for loan: IIITD (1)Call number: REF 511.352 TUR-T. Place hold Add to cart (remove)
	5.	Algorithmic randomness and complexity by Downey, R. G Hirschfeldt, Denis Roman Series: Theory and applications of computability Material type: Text; Format: print ; Literary form: Not fiction Publication details: New York : Springer, ©2010 Online access: Publisher description Table of contents only Availability: Items available for loan: IIITD (1)Call number: REF 511.3 DOW-A. Place hold Add to cart (remove)
	6.	Theory of recursive functions and effective computability by Rogers, Hartley, 1926- Material type: Text; Format: print ; Literary form: Not fiction Publication details: Cambridge, Mass. : MIT Press, ©1987 Availability: Items available for reference: IIITD: Not for loan (1)Call number: REF 511.3 ROG-T. Add to cart (remove)
	7.	Enumerability, decidability, computability : an introduction to the theory of recursive functions. by Hermes, Hans Series: Die Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen mit besonderer Berücksichtigung der Anwendungsgebiete ; Bd. 127 Edition: 2d rev. ed. Material type: Text; Format: print ; Literary form: Not fiction Language: engger Publication details: New York, Springer, ©1969 Availability: Items available for loan: IIITD (1)Call number: REF 510.01 HER-E. Place hold Add to cart (remove)
	8.	Introduction to formal languages, automata theory and computation by Krithivasan, Kamala Rama R Material type: Text; Format: print ; Literary form: Not fiction Publication details: New Delhi : Pearson Education, ©2009 Availability: Not available: IIITD: Loan on demand (1). Add to cart (remove)
	9.	Turing computability by Soare, Robert Irving Edition: 4th ed. Material type: Text; Format: print ; Literary form: Not fiction Publication details: Chicago : Springer, ©2016 Availability: Items available for reference: IIITD: Not for loan (1)Call number: REF 511.352 SOA-T. Add to cart (remove)
	10.	Recursively enumerable sets and degrees : a study of computable functions and computably generated sets by Soare, Robert I Series: Perspectives in Mathematical Logic Material type: Text; Format: print ; Literary form: Not fiction Publication details: New York : Springer, ©1987 Availability: Not available: IIITD: Checked out (1). Place hold Add to cart (remove)

© 2024 IIIT-Delhi, library@iiitd.ac.in

Powered by Koha