Holdings: Computability & unsolvability

Computability & unsolvability:

Saved in:

Bibliographic Details
Main Author:	Davis, Martin 1928-2023 (Author)
Format:	Book
Language:	English
Published:	New York [u.a.] McGraw-Hill c 1958
Edition:	2. print.
Series:	McGraw-Hill series in information processing and computers
Subjects:	Fonctions calculables Fonctions récursives Non-résolubilité (logique mathématique) combinatoire décidabilité fonction récursive logique mathématique machine Turing Turing-Maschine Berechenbarkeit Unlösbarkeit
Physical Description:	XXV, 210 S.

Staff View

MARC


LEADER	00000nam a2200000zc 4500
001	BV021891412
003	DE-604
005	20040301000000.0
007	t
008	900626s1958 \|\|\|\| 00\|\|\| eng d
035			\|a (OCoLC)77452887
035			\|a (DE-599)BVBBV021891412
040			\|a DE-604 \|b ger
041	0		\|a eng
049			\|a DE-706
084			\|a CC 2600 \|0 (DE-625)17610: \|2 rvk
084			\|a QH 120 \|0 (DE-625)141532: \|2 rvk
084			\|a SK 130 \|0 (DE-625)143216: \|2 rvk
084			\|a ST 130 \|0 (DE-625)143588: \|2 rvk
084			\|a ST 134 \|0 (DE-625)143590: \|2 rvk
100	1		\|a Davis, Martin \|d 1928-2023 \|e Verfasser \|0 (DE-588)116040866 \|4 aut
245	1	0	\|a Computability & unsolvability
246	1	3	\|a Computability and unsolvability
250			\|a 2. print.
264		1	\|a New York [u.a.] \|b McGraw-Hill \|c c 1958
300			\|a XXV, 210 S.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	0		\|a McGraw-Hill series in information processing and computers
650		7	\|a Fonctions calculables \|2 ram
650		4	\|a Fonctions récursives
650		7	\|a Fonctions récursives \|2 ram
650		7	\|a Non-résolubilité (logique mathématique) \|2 ram
650		7	\|a combinatoire \|2 inriac
650		7	\|a décidabilité \|2 inriac
650		7	\|a fonction récursive \|2 inriac
650		7	\|a logique mathématique \|2 inriac
650		7	\|a machine Turing \|2 inriac
650	0	7	\|a Turing-Maschine \|0 (DE-588)4203525-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Berechenbarkeit \|0 (DE-588)4138368-0 \|2 gnd \|9 rswk-swf
650	0	7	\|a Unlösbarkeit \|0 (DE-588)4426195-0 \|2 gnd \|9 rswk-swf
689	0	0	\|a Turing-Maschine \|0 (DE-588)4203525-9 \|D s
689	0		\|5 DE-604
689	1	0	\|a Berechenbarkeit \|0 (DE-588)4138368-0 \|D s
689	1		\|8 1\p \|5 DE-604
689	2	0	\|a Unlösbarkeit \|0 (DE-588)4426195-0 \|D s
689	2		\|8 2\p \|5 DE-604
999			\|a oai:aleph.bib-bvb.de:BVB01-015106613
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 2\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk

Record in the Search Index

_version_	1804135834738229248
adam_txt
any_adam_object
any_adam_object_boolean
author	Davis, Martin 1928-2023
author_GND	(DE-588)116040866
author_facet	Davis, Martin 1928-2023
author_role	aut
author_sort	Davis, Martin 1928-2023
author_variant	m d md
building	Verbundindex
bvnumber	BV021891412
classification_rvk	CC 2600 QH 120 SK 130 ST 130 ST 134
ctrlnum	(OCoLC)77452887 (DE-599)BVBBV021891412
discipline	Informatik Mathematik Philosophie Wirtschaftswissenschaften
discipline_str_mv	Informatik Mathematik Philosophie Wirtschaftswissenschaften
edition	2. print.
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02028nam a2200577zc 4500</leader><controlfield tag="001">BV021891412</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">900626s1958 \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)77452887</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021891412</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">CC 2600</subfield><subfield code="0">(DE-625)17610:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 120</subfield><subfield code="0">(DE-625)141532:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Davis, Martin</subfield><subfield code="d">1928-2023</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)116040866</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computability & unsolvability</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Computability and unsolvability</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. print.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York [u.a.]</subfield><subfield code="b">McGraw-Hill</subfield><subfield code="c">c 1958</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXV, 210 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">McGraw-Hill series in information processing and computers</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Fonctions calculables</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fonctions récursives</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Fonctions récursives</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Non-résolubilité (logique mathématique)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">combinatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">décidabilité</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">fonction récursive</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">logique mathématique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">machine Turing</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Turing-Maschine</subfield><subfield code="0">(DE-588)4203525-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Unlösbarkeit</subfield><subfield code="0">(DE-588)4426195-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Turing-Maschine</subfield><subfield code="0">(DE-588)4203525-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Unlösbarkeit</subfield><subfield code="0">(DE-588)4426195-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015106613</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection>
id	DE-604.BV021891412
illustrated	Not Illustrated
index_date	2024-07-02T16:04:11Z
indexdate	2024-07-09T20:46:48Z
institution	BVB
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-015106613
oclc_num	77452887
open_access_boolean
owner	DE-706
owner_facet	DE-706
physical	XXV, 210 S.
publishDate	1958
publishDateSearch	1958
publishDateSort	1958
publisher	McGraw-Hill
record_format	marc
series2	McGraw-Hill series in information processing and computers
spelling	Davis, Martin 1928-2023 Verfasser (DE-588)116040866 aut Computability & unsolvability Computability and unsolvability 2. print. New York [u.a.] McGraw-Hill c 1958 XXV, 210 S. txt rdacontent n rdamedia nc rdacarrier McGraw-Hill series in information processing and computers Fonctions calculables ram Fonctions récursives Fonctions récursives ram Non-résolubilité (logique mathématique) ram combinatoire inriac décidabilité inriac fonction récursive inriac logique mathématique inriac machine Turing inriac Turing-Maschine (DE-588)4203525-9 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Unlösbarkeit (DE-588)4426195-0 gnd rswk-swf Turing-Maschine (DE-588)4203525-9 s DE-604 Berechenbarkeit (DE-588)4138368-0 s 1\p DE-604 Unlösbarkeit (DE-588)4426195-0 s 2\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle	Davis, Martin 1928-2023 Computability & unsolvability Fonctions calculables ram Fonctions récursives Fonctions récursives ram Non-résolubilité (logique mathématique) ram combinatoire inriac décidabilité inriac fonction récursive inriac logique mathématique inriac machine Turing inriac Turing-Maschine (DE-588)4203525-9 gnd Berechenbarkeit (DE-588)4138368-0 gnd Unlösbarkeit (DE-588)4426195-0 gnd
subject_GND	(DE-588)4203525-9 (DE-588)4138368-0 (DE-588)4426195-0
title	Computability & unsolvability
title_alt	Computability and unsolvability
title_auth	Computability & unsolvability
title_exact_search	Computability & unsolvability
title_exact_search_txtP	Computability & unsolvability
title_full	Computability & unsolvability
title_fullStr	Computability & unsolvability
title_full_unstemmed	Computability & unsolvability
title_short	Computability & unsolvability
title_sort	computability unsolvability
topic	Fonctions calculables ram Fonctions récursives Fonctions récursives ram Non-résolubilité (logique mathématique) ram combinatoire inriac décidabilité inriac fonction récursive inriac logique mathématique inriac machine Turing inriac Turing-Maschine (DE-588)4203525-9 gnd Berechenbarkeit (DE-588)4138368-0 gnd Unlösbarkeit (DE-588)4426195-0 gnd
topic_facet	Fonctions calculables Fonctions récursives Non-résolubilité (logique mathématique) combinatoire décidabilité fonction récursive logique mathématique machine Turing Turing-Maschine Berechenbarkeit Unlösbarkeit
work_keys_str_mv	AT davismartin computabilityunsolvability AT davismartin computabilityandunsolvability

Holdings

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!

MARC

Record in the Search Index

There is no print copy available.

Similar Items