top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Algorithms: Main Ideas and Applications / by Vladimir Uspensky and Alexei Semenov
Algorithms: Main Ideas and Applications / by Vladimir Uspensky and Alexei Semenov
Autore Uspensky, Vladimir A.
Pubbl/distr/stampa Dordrecht, : Springer, : Kluwer, 1993
Descrizione fisica xii, 269 p. : ill. ; 24 cm
Altri autori (Persone) Semenov, Alekseĭ L.
Soggetto topico 03-XX - Mathematical logic and foundations [MSC 2020]
03Dxx - Computability and recursion theory [MSC 2020]
68-XX - Computer science [MSC 2020]
Soggetto non controllato Algorithms
Arithmetic
Boundary Element Methods
Complexity
Design
Entropy
Forms
Hardware
Information Theory
Informations
Logic
Mathematical logic
Notation
Randomness
Semantics
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Titolo uniforme
Record Nr. UNICAMPANIA-VAN00290920
Uspensky, Vladimir A.  
Dordrecht, : Springer, : Kluwer, 1993
Materiale a stampa
Lo trovi qui: Univ. Vanvitelli
Opac: Controlla la disponibilità qui
Die altrussischen Handschriften liturgischer Gesänge in sematischer Notation als Hilfsmittel der slavischen Akzentologie / Olaf Störmer
Die altrussischen Handschriften liturgischer Gesänge in sematischer Notation als Hilfsmittel der slavischen Akzentologie / Olaf Störmer
Autore Störmer Olaf
Edizione [1st, New ed.]
Pubbl/distr/stampa Frankfurt a.M, : PH02, 1987
Descrizione fisica 1 online resource (116 p.) : , EPDF
Collana Slavistische Beiträge
Soggetto topico linguistics
Soggetto non controllato Akzentologie
Altkirchenslavisch
altrussischen
Gesänge
Geschichte
Handschriften
Hilfsmittel
liturgischer
Notation
Philologie
Russland
sematischer
slavischen
Sprachwissenschaft
Störmer
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione ger
Nota di contenuto Einleitung - Vorstellung des unterschiedlichen Materials - Die musikologische Rekonstruktion - Vergleich mit den Rekonstruktionen von Dybo und Zaliznjak - Rückschlüsse auf den Entwicklungsstand des Altrussischen im 12. Jahrhundert vom Standpunkt der Akzentologie - Leistungsfähigkeit und Grenzen des musikologischen Rekonstruktionsverfahrens
Record Nr. UNINA-9910563030003321
Störmer Olaf  
Frankfurt a.M, : PH02, 1987
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
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
Opac: Controlla la disponibilità qui
Bounded Queries in Recursion Theory / William I. Gasarch, Georgia A. Martin
Bounded Queries in Recursion Theory / William I. Gasarch, Georgia A. Martin
Autore Gasarch, William I.
Pubbl/distr/stampa New York, : Springer ; Boston, : Birkhäuser, 1999
Descrizione fisica xiii, 353 p. ; 24 cm
Altri autori (Persone) Martin, Georgia A.
Soggetto non controllato Algorithms
Complexity
Computability theory
Computer Science
Computers
Notation
Simulation
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNICAMPANIA-VAN00298858
Gasarch, William I.  
New York, : Springer ; Boston, : Birkhäuser, 1999
Materiale a stampa
Lo trovi qui: Univ. Vanvitelli
Opac: Controlla la disponibilità qui
Braids, Links, and Mapping Class Groups. (AM-82), Volume 82 / / Joan S. Birman
Braids, Links, and Mapping Class Groups. (AM-82), Volume 82 / / Joan S. Birman
Autore Birman Joan S.
Pubbl/distr/stampa Princeton, NJ : , : Princeton University Press, , [2016]
Descrizione fisica 1 online resource (241 pages) : illustrations
Disciplina 514/.224
Collana Annals of Mathematics Studies
Soggetto topico Braid theory
Knot theory
Representations of groups
Soggetto non controllato Addition
Alexander polynomial
Algebraic structure
Automorphism
Ball (mathematics)
Bijection
Braid group
Braid theory
Branched covering
Burau representation
Calculation
Cartesian coordinate system
Characterization (mathematics)
Coefficient
Combinatorial group theory
Commutative property
Commutator subgroup
Configuration space
Conjugacy class
Corollary
Covering space
Dehn twist
Determinant
Diagram (category theory)
Dimension
Disjoint union
Double coset
Eigenvalues and eigenvectors
Enumeration
Equation
Equivalence class
Exact sequence
Existential quantification
Faithful representation
Finite set
Free abelian group
Free group
Fundamental group
Geometry
Group (mathematics)
Group ring
Groupoid
Handlebody
Heegaard splitting
Homeomorphism
Homomorphism
Homotopy group
Homotopy
Identity element
Identity matrix
Inclusion map
Initial point
Integer matrix
Integer
Knot polynomial
Knot theory
Lens space
Line segment
Line–line intersection
Link group
Low-dimensional topology
Mapping class group
Mathematical induction
Mathematics
Matrix group
Matrix representation
Monograph
Morphism
Natural transformation
Normal matrix
Notation
Orientability
Parity (mathematics)
Permutation
Piecewise linear
Pointwise
Polynomial
Prime knot
Projection (mathematics)
Proportionality (mathematics)
Quotient group
Requirement
Rewriting
Riemann surface
Semigroup
Sequence
Special case
Subgroup
Submanifold
Subset
Symmetric group
Theorem
Theory
Topology
Trefoil knot
Two-dimensional space
Unimodular matrix
Unit vector
Variable (mathematics)
Word problem (mathematics)
ISBN 1-4008-8142-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Frontmatter -- PREFACE -- TABLE OF CONTENTS -- CHAPTER 1. BRAID GROUPS -- CHAPTER 2. BRAIDS AND LINKS -- CHAPTER 3. MAGNUS REPRESENTATIONS -- CHAPTER 4. MAPPING CLASS GROUPS -- CHAPTER 5. PLATS AND LINKS -- APPENDIX: RESEARCH PROBLEMS -- BIBLIOGRAPHY -- INDEX -- Backmatter
Record Nr. UNINA-9910154753103321
Birman Joan S.  
Princeton, NJ : , : Princeton University Press, , [2016]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
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
Opac: Controlla la disponibilità qui
Choquet Order and Simplices : With Applications in Probabilistic Models / Gerhard Winkler
Choquet Order and Simplices : With Applications in Probabilistic Models / Gerhard Winkler
Autore Winkler, Gerhard
Pubbl/distr/stampa Berlin, : Springer, 1985
Descrizione fisica vi, 143 p. ; 24 cm
Soggetto topico 46-XX - Functional analysis [MSC 2020]
60G05 - Foundations of stochastic processes [MSC 2020]
46E27 - Spaces of measures [MSC 2020]
52A07 - Convex sets in topological vector spaces (aspects of convex geometry) [MSC 2020]
46A55 - Convex sets in topological linear spaces; Choquet theory [MSC 2020]
Soggetto non controllato Concepts
Models
Notation
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNICAMPANIA-VAN0263468
Winkler, Gerhard  
Berlin, : Springer, 1985
Materiale a stampa
Lo trovi qui: Univ. Vanvitelli
Opac: Controlla la disponibilità qui
Choquet Order and Simplices : With Applications in Probabilistic Models / Gerhard Winkler
Choquet Order and Simplices : With Applications in Probabilistic Models / Gerhard Winkler
Autore Winkler, Gerhard
Pubbl/distr/stampa Berlin, : Springer, 1985
Descrizione fisica vi, 143 p. ; 24 cm
Soggetto topico 46-XX - Functional analysis [MSC 2020]
46A55 - Convex sets in topological linear spaces; Choquet theory [MSC 2020]
46E27 - Spaces of measures [MSC 2020]
52A07 - Convex sets in topological vector spaces (aspects of convex geometry) [MSC 2020]
60G05 - Foundations of stochastic processes [MSC 2020]
Soggetto non controllato Models
Notation
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNICAMPANIA-VAN00263468
Winkler, Gerhard  
Berlin, : Springer, 1985
Materiale a stampa
Lo trovi qui: Univ. Vanvitelli
Opac: Controlla la disponibilità qui
Computational and algorithmic problems in finite fields / Igor E. Shparlinski
Computational and algorithmic problems in finite fields / Igor E. Shparlinski
Autore Shparlinski, Igor E.
Pubbl/distr/stampa Dordrecht, : Kluwer, 1992
Descrizione fisica XII, 240 p. ; 25 cm
Soggetto topico 11-XX - Number theory [MSC 2020]
11G20 - Curves over finite and local fields [MSC 2020]
11T06 - Polynomials over finite fields [MSC 2020]
11T55 - Arithmetic theory of polynomial rings over finite fields [MSC 2020]
11T71 Algebraic coding theory; cryptography [MSC 2020]
11Txx - Finite fields and commutative rings (number-theoretic aspects) [MSC 2020]
11Y16 - Number-theoretic algorithms; complexity [MSC 2020]
11Y40 - Algebraic number theory computations [MSC 2020]
14G05 - Rational points [MSC 2020]
68Q25 - Analysis of algorithms and problem complexity [MSC 2020]
94A60 - Cryptography [MSC 2020]
94B27 - Geometric methods (including applications of algebraic geometry) applied to coding theory [MSC 2020]
Soggetto non controllato Algebra
Algorithms
Coding theory
Computer Science
Computers
Cryptography
Finite fields
Notation
Number theory
ISBN 978-07-923205-7-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNICAMPANIA-VAN00024455
Shparlinski, Igor E.  
Dordrecht, : Kluwer, 1992
Materiale a stampa
Lo trovi qui: Univ. Vanvitelli
Opac: Controlla la disponibilità qui
Computational and Algorithmic Problems in Finite Fields / Igor E. Shparlinski
Computational and Algorithmic Problems in Finite Fields / Igor E. Shparlinski
Autore Shparlinski, Igor E.
Pubbl/distr/stampa Dordrecht, : Kluwer, 1992
Descrizione fisica xii, 240 p. ; 25 cm
Soggetto topico 11-XX - Number theory [MSC 2020]
11G20 - Curves over finite and local fields [MSC 2020]
11T06 - Polynomials over finite fields [MSC 2020]
11T55 - Arithmetic theory of polynomial rings over finite fields [MSC 2020]
11T71 Algebraic coding theory; cryptography [MSC 2020]
11Txx - Finite fields and commutative rings (number-theoretic aspects) [MSC 2020]
11Y16 - Number-theoretic algorithms; complexity [MSC 2020]
11Y40 - Algebraic number theory computations [MSC 2020]
14G05 - Rational points [MSC 2020]
68Q25 - Analysis of algorithms and problem complexity [MSC 2020]
94A60 - Cryptography [MSC 2020]
94B27 - Geometric methods (including applications of algebraic geometry) applied to coding theory [MSC 2020]
Soggetto non controllato Algebra
Algorithms
Coding theory
Computer Science
Computers
Cryptography
Finite fields
Notation
Number theory
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNICAMPANIA-VAN00289622
Shparlinski, Igor E.  
Dordrecht, : Kluwer, 1992
Materiale a stampa
Lo trovi qui: Univ. Vanvitelli
Opac: Controlla la disponibilità qui