000			01604pam a2200385 a 4500
001			82007287
003			AE-DuAU
005			20241127163603.0
008			050915r19821958nyu b 00110 eng
010			_a 82007287
020			_a0486614719 (pbk.)
050	0		_aQA9.615 _b.D38 1982
090			_aQA 9.615 .D38 1982
100	1		_aDavis, Martin, _d1928- _959729
245	1	0	_aComputability & unsolvability / _cMartin Davis.
250			_aDover ed.
260			_aNew York : _bDover, _c1982.
300			_axxv, 248 p. ; _c22 cm.
336			_2rdacontent _atext _btxt
337			_2rdamedia _aunmediated _bn
338			_2rdacarrier _avolume _bnc
500			_aReprint. Originally published: New York : (McGraw-Hill, 1958. McGraw-Hill series in information processing and computers. With new pref. and appendix)
500			_aIncludes index.
504			_aBibliography: p. 237-241.
520		0	_aClassic graduate-level introduction to theory of computability, usually referred to as theory of recurrent functions. New preface and appendix.
650		0	_aRecursive functions. _959730
650		0	_aUnsolvability (Mathematical logic) _959731
650		0	_aComputable functions. _959732
830		0	_aMcGraw-Hill series in information processing and computers. _959733
852			_y12-23-1997
907			_a8096 _b08-06-10 _c08-06-10
942			_cBOOK _00
998			_aaudmc _b12-23-97 _cm _da _e- _feng _gnyu _h0
945			_g0 _i19497 _j0 _laudmc _nCopy Type:01 - Books _o- _p0.00 _q- _r- _s- _t1 _u0 _v0 _w0 _x0 _yi10117179 _z08-06-10
999			_c8096 _d8096