Tools

LEADER 02009nam 22004214a 4500

001 ssj0000491970;

003 WaSeSS;

005 20250714084803.0;

006 m d ;

007 cr n ;

008 100929s2011 ne a sb 001 0 eng d;

010 a| 2010038448;

020 a| 9780123849588 (hardback);

035 a| (WaSeSS)ssj0000491970;

040 a| DLCc| DLCd| DLCd| WaSeSS;

042 a| pcc;

049 a| EREEa| NEHH;

050 00 a| QA9.6b| .E53 2011;

082 00 a| 511.3/52| 22;

100 1 a| Enderton, Herbert B.=| ^A92033;

245 10 a| Computability theoryh| [electronic resource] :b| an introduction to recursion theory /c| Herbert B. Enderton.;

260 a| Amsterdam ;a| Boston :b| Academic Press,;

300 a| 174 p. :b| ill. ;c| 24 cm.;

504 a| Includes bibliographical references (p. 163-164) and index.;

505 8 a| The Computability Concept -- General Recursive Functions -- Programs and Machines -- Recursive Enumerability -- Connections to Logic -- Degrees of Unsolvability -- Polynomial-Time Computability -- [Appendices]. Mathspeak -- Countability -- Decadic Notation.;

506 a| Available only to authorized users.;

538 a| Mode of access: World Wide Web;

650 0 a| Recursion theory.=| ^A116859;

655 0 a| Electronic books.=| ^A491897;

856 40 z| Full text available from eBook - Mathematics 2011u| https://go.openathens.net/redirector/ecu.edu?url=https%3A%2F%2Fwww.sciencedirect.com%2Fscience%2Fbook%2F9780123849588;

949 a| CLICK ON WEB ADDRESSw| ASISh| JOYNER188;

949 a| CLICK ON WEB ADDRESSw| ASISh| HSL77;

949 a| CLICK ON WEB ADDRESSw| ASISh| JMUSIC60;

596 a| 1 3 4;

998 a| 6589793;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 6589793-1001l| JNETm| JOYNERr| Ys| Yt| JNESSBKu| 7/17/2025x| EBOOKz| JERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 6589793-2001l| HSLELECm| HSLr| Ys| Yt| HEBKu| 7/17/2025x| EBOOKz| HERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 6589793-3001l| MNETm| JMUSICr| Ys| Yt| MNESSBKu| 7/17/2025x| EBOOKz| JERESOURCE;

Computability theory an introduction to recursion theory / Herbert B. Enderton.

Author/creator	Enderton, Herbert B.
Format	Electronic
Publication Info	Amsterdam ; Boston : Academic Press,
Description	174 p. : ill. ; 24 cm.
Supplemental Content	Full text available from eBook - Mathematics 2011
Subjects	Recursion theory.

Contents	The Computability Concept -- General Recursive Functions -- Programs and Machines -- Recursive Enumerability -- Connections to Logic -- Degrees of Unsolvability -- Polynomial-Time Computability -- [Appendices]. Mathspeak -- Countability -- Decadic Notation.
Bibliography note	Includes bibliographical references (p. 163-164) and index.
Access restriction	Available only to authorized users.
Technical details	Mode of access: World Wide Web
Genre/form	Electronic books.
LCCN	2010038448
ISBN	9780123849588 (hardback)

Availability

Library	Location	Call Number	Status	Item Actions
	Electronic Resources	Access Content Online	✔ Available

Computability theory an introduction to recursion theory / Herbert B. Enderton.

Click here for more information about this title

Availability