Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Automata Studies. (AM-34), Volume 34 / / J. McCarthy, C. E. Shannon
| Automata Studies. (AM-34), Volume 34 / / J. McCarthy, C. E. Shannon |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
| Descrizione fisica | 1 online resource (297 pages) : illustrations |
| Disciplina |
621.38
621.34* |
| Collana | Annals of Mathematics Studies |
| 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) |
| ISBN | 1-4008-8261-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| 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. |
| Record Nr. | UNINA-9910154745703321 |
| Princeton, NJ : , : Princeton University Press, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The Calculi of Lambda Conversion. (AM-6), Volume 6 / / Alonzo Church
| The Calculi of Lambda Conversion. (AM-6), Volume 6 / / Alonzo Church |
| Autore | Church Alonzo |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
| Descrizione fisica | 1 online resource (89 pages) |
| Disciplina | 517.5 |
| Collana | Annals of Mathematics Studies |
| Soggetto topico |
Logic, Symbolic and mathematical
Recursive functions |
| Soggetto non controllato |
2H
A-normal form Addition Alphabetical order Ambiguity Argument of a function Axiom Bibliography Big O notation Calculation Characteristic function (probability theory) Combination Complex number Computability Computation Consistency Corollary Definition Denotation Determination Differential calculus Enumeration Equation Exc Existential quantification Exponentiation Finitary Finite set Formal system Frege (programming language) Function (mathematics) Gödel numbering Identity function In the process of Integer Iteration Limit (mathematics) Logic Logical conjunction Logical disjunction Mathematical induction Mathematical logic Mathematics Metamathematics Natural number Negation Notation Null set Number theory Ordinal number Pairing Paul Bernays Primitive recursive function Principia Mathematica Propositional function Quantifier (logic) Real number Recursion (computer science) Recursion Reduction of order Requirement Resultant Rule of inference Scientific notation Sequence Set theory Special case Successor function Theorem Theory Transfinite number Transfinite Truth value Uncertainty Universal quantification Upper and lower bounds Variable (mathematics) Well-formed formula Without loss of generality |
| ISBN | 1-4008-8193-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- CONTENTS -- Chapter I. INTRODUCTORY -- Chapter II. LAMBDA-CONVERSION -- Chapter III. LAMBDA-DEFINABILITY -- Chapter IV. COMBINATIONS, GÖDEL NUMBERS -- Chapter V. THE CALCULI OF λ-K-CONVERSION AND λ-δ- CONVERSION -- INDEX OP THE PRINCIPAL FORMULAS INTRODUCED BY DEFINITION -- BIBLIOGRAPHY -- CORRECTION AND ADDITIONS |
| Record Nr. | UNINA-9910154753003321 |
Church Alonzo
|
||
| Princeton, NJ : , : Princeton University Press, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||