|
|
|
|
LEADER |
00000cam a2200000 4500 |
001 |
SCIDIR_ocn608620747 |
003 |
OCoLC |
005 |
20231117033051.0 |
006 |
m o d |
007 |
cr bn||||||abp |
007 |
cr bn||||||ada |
008 |
100422s1973 nyu ob 001 0 eng d |
040 |
|
|
|a OCLCE
|b eng
|e pn
|c OCLCE
|d OCLCQ
|d OCLCO
|d OCLCF
|d OPELS
|d OCLCQ
|d INARC
|d OCLCA
|d LUN
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|
015 |
|
|
|a GB7331972
|2 bnb
|
019 |
|
|
|a 300852529
|a 974619290
|a 974671264
|a 1148627155
|
020 |
|
|
|a 9780123900500
|q (electronic bk.)
|
020 |
|
|
|a 0123900506
|q (electronic bk.)
|
035 |
|
|
|a (OCoLC)608620747
|z (OCoLC)300852529
|z (OCoLC)974619290
|z (OCoLC)974671264
|z (OCoLC)1148627155
|
042 |
|
|
|a dlr
|
050 |
|
4 |
|a QA248.5
|b .J66
|
082 |
0 |
4 |
|a 511/.3
|2 18
|
082 |
0 |
4 |
|a 621.3819/594
|
084 |
|
|
|a ST 130
|2 rvk
|
084 |
|
|
|a ST 150
|2 rvk
|
100 |
1 |
|
|a Jones, Neil D.
|
245 |
1 |
0 |
|a Computability theory: an introduction
|c [by] Neil D. Jones.
|
260 |
|
|
|a New York,
|b Academic Press,
|c 1973.
|
300 |
|
|
|a 1 online resource (xiv, 154 pages)
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
490 |
1 |
|
|a ACM monograph series
|
504 |
|
|
|a Includes bibliographical references (pages 149-150).
|
506 |
|
|
|3 Use copy
|f Restrictions unspecified
|2 star
|5 MiAaHDL
|
533 |
|
|
|a Electronic reproduction.
|b [Place of publication not identified] :
|c HathiTrust Digital Library,
|d 2010.
|5 MiAaHDL
|
538 |
|
|
|a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
|u http://purl.oclc.org/DLF/benchrepro0212
|5 MiAaHDL
|
583 |
1 |
|
|a digitized
|c 2010
|h HathiTrust Digital Library
|l committed to preserve
|2 pda
|5 MiAaHDL
|
588 |
0 |
|
|a Print version record.
|
505 |
0 |
|
|a Mathematical basis -- Introduction to computability -- Description of Turing machines by predicates -- Decision of predicates by Turing machines -- The normal form theorems and consequences -- Other formulations of computability.
|
650 |
|
0 |
|a Recursive functions.
|
650 |
|
0 |
|a Turing machines.
|
650 |
|
0 |
|a Computable functions.
|
650 |
|
6 |
|a Fonctions r�ecursives.
|0 (CaQQLa)201-0024594
|
650 |
|
6 |
|a Machines de Turing.
|0 (CaQQLa)201-0002737
|
650 |
|
6 |
|a Fonctions calculables.
|0 (CaQQLa)201-0078765
|
650 |
|
7 |
|a Computable functions
|2 fast
|0 (OCoLC)fst00871985
|
650 |
|
7 |
|a Recursive functions
|2 fast
|0 (OCoLC)fst01091984
|
650 |
|
7 |
|a Turing machines
|2 fast
|0 (OCoLC)fst01159283
|
650 |
|
7 |
|a Berechenbarkeit
|2 gnd
|0 (DE-588)4138368-0
|
650 |
|
7 |
|a Computer
|2 gnd
|0 (DE-588)4070083-5
|
650 |
|
7 |
|a Theorie
|2 gnd
|0 (DE-588)4059787-8
|
650 |
|
7 |
|a Fonctions r�ecursives.
|2 ram
|
650 |
|
7 |
|a Turing, Machines de.
|2 ram
|
653 |
|
|
|a Mathematics
|a Recursive functions
|a Computability theory
|
776 |
0 |
8 |
|i Print version:
|a Jones, Neil D.
|t Computability theory: an introduction.
|d New York, Academic Press, 1973
|w (DLC) 72009331
|w (OCoLC)623268
|
830 |
|
0 |
|a ACM monograph series.
|
856 |
4 |
0 |
|u https://sciencedirect.uam.elogim.com/science/book/9780123900500
|z Texto completo
|