Automata Studies. (AM-34), Volume 34 / / J. McCarthy, C. E. Shannon

• Pubblicazione: Princeton, NJ : , : Princeton University Press, , [2016]; ©1956
• Descrizione fisica: 1 online resource (297 pages) : illustrations
• Disciplina: 621.38; 621.34*
• Soggetto topico: Machine theory; Conscious automata
• Soggetto non controllato: 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)
• Persona (resp. second.): McCarthyJ.; ShannonC. E.
• Nota di bibliografia: Includes bibliographies.
• Nota di contenuto: Frontmatter -- Preface -- Contents -- Finite Automata -- Representation of Events in Nerve Nets and Finite Automata / Kleene, S. C. -- Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components / Neumann, J. von -- Some Uneconomical Robots / Culbertson, James T. -- Some Universal Elements for Finite Automata / Minsky, M. L. -- Gedanken-Experiments on Sequential Machines / Moore, Edward F. -- Turing Machines -- A Universal Turing Machine with Two Internal States / Shannon, Claude E. -- A Note on Universal Turing Machines / Davis, M. D. -- The Inversion of Functions Defined by Turing Machines / McCarthy, John -- Computability by Probabilistic Machines / Leeuw, K. de / Moore, E. F. / Shannon, C. E. / Shapiro, N. -- Synthesis of Automata -- Design for an Intelligence-Amplifier / Ashby, W. Ross -- The Epistemological Problem for Automata / MacKay, D. M. -- Conditional Probability Machines and Conditioned Reflexes / Uttley, Albert M. -- Temporal and Spatial Patterns in a Conditional Probability Machine / Uttley, Albert M.
• Sommario/riassunto: The description for this book, Automata Studies. (AM-34), Volume 34, will be forthcoming.
• Titolo autorizzato: Automata Studies. (AM-34), Volume 34
• ISBN: 1-4008-8261-3
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910154745703321
• Lo trovi qui: Univ. Federico II
• Serie: Annals of mathematics studies ; ; no. 34.