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 | ||
| ||
Outer billiards on kites [[electronic resource] /] / Richard Evan Schwartz
| Outer billiards on kites [[electronic resource] /] / Richard Evan Schwartz |
| Autore | Schwartz Richard Evan |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, NJ, : Princeton University Press, c2009 |
| Descrizione fisica | 1 online resource (321 p.) |
| Disciplina | 516.9 |
| Collana | Annals of mathematics studies |
| Soggetto topico |
Hyperbolic spaces
Singularities (Mathematics) Transformations (Mathematics) Geometry, Plane |
| Soggetto non controllato |
Abelian group
Automorphism Big O notation Bijection Binary number Bisection Borel set C0 Calculation Cantor set Cartesian coordinate system Combination Compass-and-straightedge construction Congruence subgroup Conjecture Conjugacy class Continuity equation Convex lattice polytope Convex polytope Coprime integers Counterexample Cyclic group Diameter Diophantine approximation Diophantine equation Disjoint sets Disjoint union Division by zero Embedding Equation Equivalence class Ergodic theory Ergodicity Factorial Fiber bundle Fibonacci number Fundamental domain Gauss map Geometry Half-integer Homeomorphism Hyperbolic geometry Hyperplane Ideal triangle Intersection (set theory) Interval exchange transformation Inverse function Inverse limit Isometry group Lattice (group) Limit set Line segment Linear algebra Linear function Line–line intersection Main diagonal Modular group Monotonic function Multiple (mathematics) Orthant Outer billiard Parallelogram Parameter Partial derivative Penrose tiling Permutation Piecewise Polygon Polyhedron Polytope Product topology Projective geometry Rectangle Renormalization Rhombus Right angle Rotational symmetry Sanity check Scientific notation Semicircle Sign (mathematics) Special case Square root of 2. Subsequence Summation Symbolic dynamics Symmetry group Tangent Tetrahedron Theorem Toy model Translational symmetry Trapezoid Triangle group Triangle inequality Two-dimensional space Upper and lower bounds Upper half-plane Without loss of generality Yair Minsky |
| ISBN |
1-282-45858-2
9786612458583 1-4008-3197-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1. Introduction -- Part 1. The Erratic Orbits Theorem -- Chapter 2. The Arithmetic Graph -- Chapter 3. The Hexagrid Theorem -- Chapter 4. Period Copying -- Chapter 5. Proof of the Erratic Orbits Theorem -- Part 2. The Master Picture Theorem -- Chapter 6. The Master Picture Theorem -- Chapter 7. The Pinwheel Lemma -- Chapter 8. The Torus Lemma -- Chapter 9. The Strip Functions -- Chapter 10. Proof of the Master Picture Theorem -- Part 3. Arithmetic Graph Structure Theorems -- Chapter 11. Proof of the Embedding Theorem -- Chapter 12. Extension and Symmetry -- Chapter 13. Proof of Hexagrid Theorem I -- Chapter 14. The Barrier Theorem -- Chapter 15. Proof of Hexagrid Theorem II -- Chapter 16. Proof of the Intersection Lemma -- Part 4. Period-Copying Theorems -- Chapter 17. Diophantine Approximation -- Chapter 18. The Diophantine Lemma -- Chapter 19. The Decomposition Theorem -- Chapter 20. Existence of Strong Sequences -- Part 5. The Comet Theorem -- Chapter 21. Structure of the Inferior and Superior Sequences -- Chapter 22. The Fundamental Orbit -- Chapter 23. The Comet Theorem -- Chapter 24. Dynamical Consequences -- Chapter 25. Geometric Consequences -- Part 6. More Structure Theorems -- Chapter 26. Proof of the Copy Theorem -- Chapter 27. Pivot Arcs in the Even Case -- Chapter 28. Proof of the Pivot Theorem -- Chapter 29. Proof of the Period Theorem -- Chapter 30. Hovering Components -- Chapter 31. Proof of the Low Vertex Theorem -- Appendix -- Bibliography -- Index |
| Record Nr. | UNINA-9910781200003321 |
Schwartz Richard Evan
|
||
| Princeton, NJ, : Princeton University Press, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Self-Regularity : A New Paradigm for Primal-Dual Interior-Point Algorithms / / Jiming Peng, Cornelis Roos, Tamás Terlaky
| Self-Regularity : A New Paradigm for Primal-Dual Interior-Point Algorithms / / Jiming Peng, Cornelis Roos, Tamás Terlaky |
| Autore | Peng Jiming |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2009] |
| Descrizione fisica | 1 online resource (201 p.) |
| Disciplina | 519.6 |
| Collana | Princeton Series in Applied Mathematics |
| Soggetto topico |
Interior-point methods
Mathematical optimization Programming (Mathematics) Civil & Environmental Engineering Engineering & Applied Sciences Operations Research |
| Soggetto non controllato |
Accuracy and precision
Algorithm Analysis of algorithms Analytic function Associative property Barrier function Binary number Block matrix Combination Combinatorial optimization Combinatorics Complexity Conic optimization Continuous optimization Control theory Convex optimization Delft University of Technology Derivative Differentiable function Directional derivative Division by zero Dual space Duality (mathematics) Duality gap Eigenvalues and eigenvectors Embedding Equation Estimation Existential quantification Explanation Feasible region Filter design Function (mathematics) Implementation Instance (computer science) Invertible matrix Iteration Jacobian matrix and determinant Jordan algebra Karmarkar's algorithm Karush–Kuhn–Tucker conditions Line search Linear complementarity problem Linear function Linear programming Lipschitz continuity Local convergence Loss function Mathematical optimization Mathematician Mathematics Matrix function McMaster University Monograph Multiplication operator Newton's method Nonlinear programming Nonlinear system Notation Operations research Optimal control Optimization problem Parameter (computer programming) Parameter Pattern recognition Polyhedron Polynomial Positive semidefinite Positive-definite matrix Quadratic function Requirement Result Scientific notation Second derivative Self-concordant function Sensitivity analysis Sign (mathematics) Signal processing Simplex algorithm Simultaneous equations Singular value Smoothness Solution set Solver Special case Subset Suggestion Technical report Theorem Theory Time complexity Two-dimensional space Upper and lower bounds Variable (computer science) Variable (mathematics) Variational inequality Variational principle Without loss of generality Worst-case complexity Yurii Nesterov |
| ISBN |
1-282-08760-6
9786612087608 1-4008-2513-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Preface -- Acknowledgments -- Notation -- List of Abbreviations -- Chapter 1. Introduction and Preliminaries -- Chapter 2. Self-Regular Functions and Their Properties -- Chapter 3. Primal-Dual Algorithms for Linear Optimization Based on Self-Regular Proximities -- Chapter 4. Interior-Point Methods for Complementarity Problems Based on Self- Regular Proximities -- Chapter 5. Primal-Dual Interior-Point Methods for Semidefinite Optimization Based on Self-Regular Proximities -- Chapter 6. Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities -- Chapter 7. Initialization: Embedding Models for Linear Optimization, Complementarity Problems, Semidefinite Optimization and Second-Order Conic Optimization -- Chapter 8. Conclusions -- References -- Index |
| Record Nr. | UNINA-9910777727403321 |
|
Peng Jiming
|
||
| Princeton, NJ : , : Princeton University Press, , [2009] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||