Automata Studies. (AM-34), Volume 34 / / ed. by J. McCarthy, C. E. Shannon.
The description for this book, Automata Studies. (AM-34), Volume 34, will be forthcoming.
Saved in:
| Superior document: | Title is part of eBook package: De Gruyter Princeton Annals of Mathematics eBook-Package 1940-2020 |
|---|---|
| MitwirkendeR: | |
| HerausgeberIn: | |
| Place / Publishing House: | Princeton, NJ : : Princeton University Press, , [2016] ©1956 |
| Year of Publication: | 2016 |
| Language: | English |
| Series: | Annals of Mathematics Studies ;
34 |
| Online Access: | |
| Physical Description: | 1 online resource (285 p.) |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
9781400882618 |
|---|---|
| ctrlnum |
(DE-B1597)468027 (OCoLC)979580919 |
| collection |
bib_alma |
| record_format |
marc |
| spelling |
Automata Studies. (AM-34), Volume 34 / ed. by J. McCarthy, C. E. Shannon. Princeton, NJ : Princeton University Press, [2016] ©1956 1 online resource (285 p.) text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Annals of Mathematics Studies ; 34 Frontmatter -- Preface -- Contents -- Finite Automata -- Representation of Events in Nerve Nets and Finite Automata -- Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components -- Some Uneconomical Robots -- Some Universal Elements for Finite Automata -- Gedanken-Experiments on Sequential Machines -- Turing Machines -- A Universal Turing Machine with Two Internal States -- A Note on Universal Turing Machines -- The Inversion of Functions Defined by Turing Machines -- Computability by Probabilistic Machines -- Synthesis of Automata -- Design for an Intelligence-Amplifier -- The Epistemological Problem for Automata -- Conditional Probability Machines and Conditioned Reflexes -- Temporal and Spatial Patterns in a Conditional Probability Machine restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star The description for this book, Automata Studies. (AM-34), Volume 34, will be forthcoming. Issued also in print. Mode of access: Internet via World Wide Web. In English. Description based on online resource; title from PDF title page (publisher's Web site, viewed 31. Jan 2022) Conscious automata. Machine theory. COMPUTERS / Computer Science. bisacsh A Mathematical Theory of Communication. Abstraction (software engineering). Accuracy and precision. Algebraic theory. Arithmetic. Automaton. Axiom. Binary number. Biophysics. Bit. Boolean algebra (structure). Calculation. Chaos theory. Circuit design. Classical conditioning. Combination lock. Combination. Computable number. Computation. Concepts (C++). Conditional probability. Connectivity (graph theory). Correlation and dependence. Counterexample. Counting. Decision problem. Description number. Detection. Determinism. Deterministic system (philosophy). Diagram (category theory). Diagram. Entscheidungsproblem. Enumeration. Equation. Estimation. Exponentiation. Finite-state machine. First principle. Fixed point (mathematics). Function (mathematics). Gödel numbering. Hardware random number generator. Heuristic argument. Instance (computer science). Interlacing (bitmaps). Intuitionistic logic. Lebesgue measure. Logarithm. Logic. Logical disjunction. Markov chain. Mathematical analysis. Mathematical induction. Mathematical logic. Mathematical notation. Mathematical theory. Mathematics. Measure (mathematics). Metamathematics. Modular arithmetic. Moment (mathematics). Moore machine. Notation. Number theory. OR gate. Parameter (computer programming). Parity (mathematics). Permutation. Pilot plant. Polynomial. Primitive recursive function. Probability measure. Probability. Proportionality (mathematics). Propositional function. Quantity. Recursion (computer science). Recursive set. Recursively enumerable set. Result. Schematic. Sequence. Series (mathematics). Set theory. Sheffer stroke. Sign (mathematics). Solver. Special case. Stochastic process. String (computer science). Subsequence. Subset. Theorem. Thermodynamic equilibrium. Trial and error. Turing machine. Typewriter. Universal Turing machine. Variable (mathematics). Ashby, W. Ross, contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Culbertson, James T., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Davis, M. D., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Kleene, S. C., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Leeuw, K. de, contributor. ctb https://id.loc.gov/vocabulary/relators/ctb MacKay, D. M., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb McCarthy, J., editor. edt http://id.loc.gov/vocabulary/relators/edt McCarthy, John, contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Minsky, M. L., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Moore, E. F., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Moore, Edward F., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Neumann, J. von, contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Shannon, C. E., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Shannon, C. E., editor. edt http://id.loc.gov/vocabulary/relators/edt Shannon, Claude E., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Shapiro, N., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Uttley, Albert M., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Title is part of eBook package: De Gruyter Princeton Annals of Mathematics eBook-Package 1940-2020 9783110494914 ZDB-23-PMB Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Archive 1927-1999 9783110442496 print 9780691079165 https://doi.org/10.1515/9781400882618 https://www.degruyter.com/isbn/9781400882618 Cover https://www.degruyter.com/document/cover/isbn/9781400882618/original |
| language |
English |
| format |
eBook |
| author2 |
Ashby, W. Ross, Ashby, W. Ross, Culbertson, James T., Culbertson, James T., Davis, M. D., Davis, M. D., Kleene, S. C., Kleene, S. C., Leeuw, K. de, Leeuw, K. de, MacKay, D. M., MacKay, D. M., McCarthy, J., McCarthy, J., McCarthy, John, McCarthy, John, Minsky, M. L., Minsky, M. L., Moore, E. F., Moore, E. F., Moore, Edward F., Moore, Edward F., Neumann, J. von, Neumann, J. von, Shannon, C. E., Shannon, C. E., Shannon, C. E., Shannon, C. E., Shannon, Claude E., Shannon, Claude E., Shapiro, N., Shapiro, N., Uttley, Albert M., Uttley, Albert M., |
| author_facet |
Ashby, W. Ross, Ashby, W. Ross, Culbertson, James T., Culbertson, James T., Davis, M. D., Davis, M. D., Kleene, S. C., Kleene, S. C., Leeuw, K. de, Leeuw, K. de, MacKay, D. M., MacKay, D. M., McCarthy, J., McCarthy, J., McCarthy, John, McCarthy, John, Minsky, M. L., Minsky, M. L., Moore, E. F., Moore, E. F., Moore, Edward F., Moore, Edward F., Neumann, J. von, Neumann, J. von, Shannon, C. E., Shannon, C. E., Shannon, C. E., Shannon, C. E., Shannon, Claude E., Shannon, Claude E., Shapiro, N., Shapiro, N., Uttley, Albert M., Uttley, Albert M., |
| author2_variant |
w r a wr wra w r a wr wra j t c jt jtc j t c jt jtc m d d md mdd m d d md mdd s c k sc sck s c k sc sck k d l kd kdl k d l kd kdl d m m dm dmm d m m dm dmm j m jm j m jm j m jm j m jm m l m ml mlm m l m ml mlm e f m ef efm e f m ef efm e f m ef efm e f m ef efm j v n jv jvn j v n jv jvn c e s ce ces c e s ce ces c e s ce ces c e s ce ces c e s ce ces c e s ce ces n s ns n s ns a m u am amu a m u am amu |
| author2_role |
MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR HerausgeberIn HerausgeberIn MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR HerausgeberIn HerausgeberIn MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR |
| author_sort |
Ashby, W. Ross, |
| title |
Automata Studies. (AM-34), Volume 34 / |
| spellingShingle |
Automata Studies. (AM-34), Volume 34 / Annals of Mathematics Studies ; Frontmatter -- Preface -- Contents -- Finite Automata -- Representation of Events in Nerve Nets and Finite Automata -- Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components -- Some Uneconomical Robots -- Some Universal Elements for Finite Automata -- Gedanken-Experiments on Sequential Machines -- Turing Machines -- A Universal Turing Machine with Two Internal States -- A Note on Universal Turing Machines -- The Inversion of Functions Defined by Turing Machines -- Computability by Probabilistic Machines -- Synthesis of Automata -- Design for an Intelligence-Amplifier -- The Epistemological Problem for Automata -- Conditional Probability Machines and Conditioned Reflexes -- Temporal and Spatial Patterns in a Conditional Probability Machine |
| title_full |
Automata Studies. (AM-34), Volume 34 / ed. by J. McCarthy, C. E. Shannon. |
| title_fullStr |
Automata Studies. (AM-34), Volume 34 / ed. by J. McCarthy, C. E. Shannon. |
| title_full_unstemmed |
Automata Studies. (AM-34), Volume 34 / ed. by J. McCarthy, C. E. Shannon. |
| title_auth |
Automata Studies. (AM-34), Volume 34 / |
| title_alt |
Frontmatter -- Preface -- Contents -- Finite Automata -- Representation of Events in Nerve Nets and Finite Automata -- Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components -- Some Uneconomical Robots -- Some Universal Elements for Finite Automata -- Gedanken-Experiments on Sequential Machines -- Turing Machines -- A Universal Turing Machine with Two Internal States -- A Note on Universal Turing Machines -- The Inversion of Functions Defined by Turing Machines -- Computability by Probabilistic Machines -- Synthesis of Automata -- Design for an Intelligence-Amplifier -- The Epistemological Problem for Automata -- Conditional Probability Machines and Conditioned Reflexes -- Temporal and Spatial Patterns in a Conditional Probability Machine |
| title_new |
Automata Studies. (AM-34), Volume 34 / |
| title_sort |
automata studies. (am-34), volume 34 / |
| series |
Annals of Mathematics Studies ; |
| series2 |
Annals of Mathematics Studies ; |
| publisher |
Princeton University Press, |
| publishDate |
2016 |
| physical |
1 online resource (285 p.) Issued also in print. |
| contents |
Frontmatter -- Preface -- Contents -- Finite Automata -- Representation of Events in Nerve Nets and Finite Automata -- Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components -- Some Uneconomical Robots -- Some Universal Elements for Finite Automata -- Gedanken-Experiments on Sequential Machines -- Turing Machines -- A Universal Turing Machine with Two Internal States -- A Note on Universal Turing Machines -- The Inversion of Functions Defined by Turing Machines -- Computability by Probabilistic Machines -- Synthesis of Automata -- Design for an Intelligence-Amplifier -- The Epistemological Problem for Automata -- Conditional Probability Machines and Conditioned Reflexes -- Temporal and Spatial Patterns in a Conditional Probability Machine |
| isbn |
9781400882618 9783110494914 9783110442496 9780691079165 |
| callnumber-first |
T - Technology |
| callnumber-subject |
TJ - Mechanical Engineering and Machinery |
| callnumber-label |
TJ211 |
| callnumber-sort |
TJ 3211 |
| url |
https://doi.org/10.1515/9781400882618 https://www.degruyter.com/isbn/9781400882618 https://www.degruyter.com/document/cover/isbn/9781400882618/original |
| illustrated |
Not Illustrated |
| dewey-hundreds |
600 - Technology |
| dewey-tens |
620 - Engineering |
| dewey-ones |
621 - Applied physics |
| dewey-full |
621.38 |
| dewey-sort |
3621.38 |
| dewey-raw |
621.38 |
| dewey-search |
621.38 |
| doi_str_mv |
10.1515/9781400882618 |
| oclc_num |
979580919 |
| work_keys_str_mv |
AT ashbywross automatastudiesam34volume34 AT culbertsonjamest automatastudiesam34volume34 AT davismd automatastudiesam34volume34 AT kleenesc automatastudiesam34volume34 AT leeuwkde automatastudiesam34volume34 AT mackaydm automatastudiesam34volume34 AT mccarthyj automatastudiesam34volume34 AT mccarthyjohn automatastudiesam34volume34 AT minskyml automatastudiesam34volume34 AT mooreef automatastudiesam34volume34 AT mooreedwardf automatastudiesam34volume34 AT neumannjvon automatastudiesam34volume34 AT shannonce automatastudiesam34volume34 AT shannonclaudee automatastudiesam34volume34 AT shapiron automatastudiesam34volume34 AT uttleyalbertm automatastudiesam34volume34 |
| status_str |
n |
| ids_txt_mv |
(DE-B1597)468027 (OCoLC)979580919 |
| carrierType_str_mv |
cr |
| hierarchy_parent_title |
Title is part of eBook package: De Gruyter Princeton Annals of Mathematics eBook-Package 1940-2020 Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Archive 1927-1999 |
| is_hierarchy_title |
Automata Studies. (AM-34), Volume 34 / |
| container_title |
Title is part of eBook package: De Gruyter Princeton Annals of Mathematics eBook-Package 1940-2020 |
| author2_original_writing_str_mv |
noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField |
| _version_ |
1806143645433200640 |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>08532nam a22021135i 4500</leader><controlfield tag="001">9781400882618</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20220131112047.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">220131t20161956nju fo d z eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400882618</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400882618</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)468027</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)979580919</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">nju</subfield><subfield code="c">US-NJ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">TJ211</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM014000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">621.38</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Automata Studies. (AM-34), Volume 34 /</subfield><subfield code="c">ed. by J. McCarthy, C. E. Shannon.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ : </subfield><subfield code="b">Princeton University Press, </subfield><subfield code="c">[2016]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©1956</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (285 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Annals of Mathematics Studies ;</subfield><subfield code="v">34</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Preface -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">Finite Automata -- </subfield><subfield code="t">Representation of Events in Nerve Nets and Finite Automata -- </subfield><subfield code="t">Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components -- </subfield><subfield code="t">Some Uneconomical Robots -- </subfield><subfield code="t">Some Universal Elements for Finite Automata -- </subfield><subfield code="t">Gedanken-Experiments on Sequential Machines -- </subfield><subfield code="t">Turing Machines -- </subfield><subfield code="t">A Universal Turing Machine with Two Internal States -- </subfield><subfield code="t">A Note on Universal Turing Machines -- </subfield><subfield code="t">The Inversion of Functions Defined by Turing Machines -- </subfield><subfield code="t">Computability by Probabilistic Machines -- </subfield><subfield code="t">Synthesis of Automata -- </subfield><subfield code="t">Design for an Intelligence-Amplifier -- </subfield><subfield code="t">The Epistemological Problem for Automata -- </subfield><subfield code="t">Conditional Probability Machines and Conditioned Reflexes -- </subfield><subfield code="t">Temporal and Spatial Patterns in a Conditional Probability Machine</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The description for this book, Automata Studies. (AM-34), Volume 34, will be forthcoming.</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 31. Jan 2022)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Conscious automata.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Machine theory.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Computer Science.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">A Mathematical Theory of Communication.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Abstraction (software engineering).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Accuracy and precision.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Algebraic theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Arithmetic.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Automaton.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Axiom.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Binary number.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Biophysics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Bit.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Boolean algebra (structure).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Calculation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Chaos theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Circuit design.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Classical conditioning.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Combination lock.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Combination.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Computable number.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Computation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Concepts (C++).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Conditional probability.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Connectivity (graph theory).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Correlation and dependence.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Counterexample.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Counting.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Decision problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Description number.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Detection.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Determinism.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Deterministic system (philosophy).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Diagram (category theory).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Diagram.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Entscheidungsproblem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Enumeration.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Equation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Estimation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Exponentiation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Finite-state machine.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">First principle.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Fixed point (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Function (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Gödel numbering.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Hardware random number generator.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Heuristic argument.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Instance (computer science).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Interlacing (bitmaps).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Intuitionistic logic.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Lebesgue measure.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Logarithm.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Logic.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Logical disjunction.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Markov chain.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematical analysis.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematical induction.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematical logic.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematical notation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematical theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Measure (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Metamathematics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Modular arithmetic.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Moment (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Moore machine.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Notation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Number theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">OR gate.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Parameter (computer programming).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Parity (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Permutation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Pilot plant.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Polynomial.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Primitive recursive function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Probability measure.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Probability.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Proportionality (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Propositional function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Quantity.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Recursion (computer science).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Recursive set.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Recursively enumerable set.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Result.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Schematic.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Sequence.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Series (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Set theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Sheffer stroke.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Sign (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Solver.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Special case.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Stochastic process.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">String (computer science).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Subsequence.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Subset.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Thermodynamic equilibrium.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Trial and error.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Turing machine.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Typewriter.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Universal Turing machine.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Variable (mathematics).</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ashby, W. Ross, </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Culbertson, James T., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Davis, M. D., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kleene, S. C., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Leeuw, K. de, </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">MacKay, D. M., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">McCarthy, J., </subfield><subfield code="e">editor.</subfield><subfield code="4">edt</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">McCarthy, John, </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Minsky, M. L., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Moore, E. F., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Moore, Edward F., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Neumann, J. von, </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shannon, C. E., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shannon, C. E., </subfield><subfield code="e">editor.</subfield><subfield code="4">edt</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shannon, Claude E., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shapiro, N., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Uttley, Albert M., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton Annals of Mathematics eBook-Package 1940-2020</subfield><subfield code="z">9783110494914</subfield><subfield code="o">ZDB-23-PMB</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton University Press eBook-Package Archive 1927-1999</subfield><subfield code="z">9783110442496</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9780691079165</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9781400882618</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9781400882618</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/document/cover/isbn/9781400882618/original</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-044249-6 Princeton University Press eBook-Package Archive 1927-1999</subfield><subfield code="c">1927</subfield><subfield code="d">1999</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_PPALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-PMB</subfield><subfield code="c">1940</subfield><subfield code="d">2020</subfield></datafield></record></collection> |