Normal view MARC view ISBD view

Enumerability, decidability, computability ; an introduction to the theory of recursive functions /

By:

Contributor(s):

Material type: Text

TextSeries: Die Grundlehren der Mathematichen Wissenschaften- ; v. 127Publication details: Berlin: Springer-Verlag, 1965Description: ix, 245p. IndexDDC classification:

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	Collection	Call number	Status	Date due	Barcode
Book	ISID	GR	511.6 H553.ED (Browse shelf(Opens below))	Available		G73

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available			Next
Previous	511.6 B394.AC Applied combinatorial mathematics /	511.6 C748.CM Combinatorial mathematics and its applications ; proceedings of the second Chapel Hill conference /	511.6 H178.CT Combinatorial theory	511.6 H553.ED Enumerability, decidability, computability ; an introduction to the theory of recursive functions /	511.6 In39.CA Combinatorics and applications; proceedings of the seminar in honour of S. S. Shrikhande, held at I.S.I., 14-17, Dec. 1982	511.6 L253.RT Ramsey theory on the integers	511.6 L896.CP Combinatorial problems and exercises	Next