Tools

LEADER 02409cam a2200409 a 4500

001 ocm41070843;

003 OCoLC;

005 20141212144745.0;

008 990318s1999 ne a b 001 0 eng ;

010 a| 99025568;

015 a| GBA0-01937;

020 a| 0444898824 (acid-free paper);

035 a| (Sirsi) o41070843;

035 a| (OCoLC)41070843;

049 a| EREE;

050 00 a| QA9.59b| .H36 1999;

072 7 a| QA2| lcco;

082 00 a| 511.32| 21;

245 00 a| Handbook of computability theory /c| edited by Edward R. Griffor.;

250 a| 1st ed.;

260 a| Amsterdam ;a| New York :b| Elsevier,c| 1999.;

300 a| xii, 727 pages :b| illustrations ;c| 23 cm.;

336 a| text2| rdacontent;

337 a| unmediated2| rdamedia;

338 a| volume2| rdacarrier;

490 1 a| Studies in logic and the foundations of mathematics ;v| v. 140;

504 a| Includes bibliographical references and indexes.;

505 0 a| The history and concpt of computability / R.I. Soare -- Recursively bounded (r.b.) classes in recursion theory / D. Cenzer -- Reducibilities / P. Odifreddi -- Local degree theory / S.B. Cooper -- The global structure of the Turing degrees / T.A. Slaman -- The recursively enumerable degrees / R.A. Shore -- An overview of the computably enumerable sets / R.I. Soare -- The continuous functionals / D. Normann -- Ordinal recursion theory / C.T. Chong and S.D. Friedman -- E-recursion / G.E. Sacks -- Recursion on abstract structures / P.G. Hinman -- Computable rings and fields / V. Stoltenberg-Hansen and J.V. Tucker -- The structure of computability in analysis and physical theory : an extension of Church's thesis / M.B. Pour-El -- Theory of numberings / Y.L. Ershov -- Pure recursive model theory / T.S. Millar -- Classifying recursive functions / H. Schwichtenberg -- Computation models and function algebras / P. Clote -- Polynomial time reducibilities and degrees / K. Ambos-Spies.;

650 0 a| Computable functions.=| ^A60697;

700 1 a| Griffor, Edward R.=| ^A465610;

830 0 a| Studies in logic and the foundations of mathematicsv| v. 140.=| ^A16526;

994 a| E0b| ERE;

938 a| Otto Harrassowitzb| HARRn| har005110835c| 262.00 DEM;

596 a| 1;

998 a| 776101;

999 a| QA9.59 .H36 1999w| LCc| 1i| 30372011068217d| 1/31/2013l| JGESm| JOYNERp| $149.50q| 1r| Ys| Yt| JGESBKu| 11/30/2000x| BOOKz| JSTACKSo| .STAFF. 0;

Handbook of computability theory / edited by Edward R. Griffor.

Other author	Griffor, Edward R.
Format	Book
Edition	1st ed.
Publication Info	Amsterdam ; New York : Elsevier, 1999.
Description	xii, 727 pages : illustrations ; 23 cm.
Subjects	Computable functions.

Series	Studies in logic and the foundations of mathematics ; v. 140 Studies in logic and the foundations of mathematics v. 140. ^A16526
Contents	The history and concpt of computability / R.I. Soare -- Recursively bounded (r.b.) classes in recursion theory / D. Cenzer -- Reducibilities / P. Odifreddi -- Local degree theory / S.B. Cooper -- The global structure of the Turing degrees / T.A. Slaman -- The recursively enumerable degrees / R.A. Shore -- An overview of the computably enumerable sets / R.I. Soare -- The continuous functionals / D. Normann -- Ordinal recursion theory / C.T. Chong and S.D. Friedman -- E-recursion / G.E. Sacks -- Recursion on abstract structures / P.G. Hinman -- Computable rings and fields / V. Stoltenberg-Hansen and J.V. Tucker -- The structure of computability in analysis and physical theory : an extension of Church's thesis / M.B. Pour-El -- Theory of numberings / Y.L. Ershov -- Pure recursive model theory / T.S. Millar -- Classifying recursive functions / H. Schwichtenberg -- Computation models and function algebras / P. Clote -- Polynomial time reducibilities and degrees / K. Ambos-Spies.
Bibliography note	Includes bibliographical references and indexes.
LCCN	99025568
ISBN	0444898824 (acid-free paper)

Availability

Library	Location	Call Number	Status	Item Actions
Joyner	General Stacks	QA9.59 .H36 1999	✔ Available	Place Hold

Handbook of computability theory / edited by Edward R. Griffor.

Click here for more information about this title

Availability