Angebote zu "Recursion" (8 Treffer)

Kategorien

Shops

Recursion across Domains
118,49 € *
ggf. zzgl. Versand

Recursion across Domains ab 118.49 € als pdf eBook: . Aus dem Bereich: eBooks, Fachthemen & Wissenschaft, Sprachwissenschaften,

Anbieter: hugendubel
Stand: 12.07.2020
Zum Angebot
Recursion across Domains
118,49 € *
ggf. zzgl. Versand

Recursion across Domains ab 118.49 EURO

Anbieter: ebook.de
Stand: 12.07.2020
Zum Angebot
Recursion across Domains
118,49 € *
ggf. zzgl. Versand

Recursion across Domains ab 118.49 EURO

Anbieter: ebook.de
Stand: 12.07.2020
Zum Angebot
Semantics of the Probabilistic Typed Lambda Cal...
144,00 CHF *
ggf. zzgl. Versand

This book takes a foundational approach to the semantics of probabilistic programming. It elaborates a rigorous Markov chain semantics for the probabilistic typed lambda calculus, which is the typed lambda calculus with recursion plus probabilistic choice. The book starts with a recapitulation of the basic mathematical tools needed throughout the book, in particular Markov chains, graph theory and domain theory, and also explores the topic of inductive definitions. It then defines the syntax and establishes the Markov chain semantics of the probabilistic lambda calculus and, furthermore, both a graph and a tree semantics. Based on that, it investigates the termination behavior of probabilistic programs. It introduces the notions of termination degree, bounded termination and path stoppability and investigates their mutual relationships. Lastly, it defines a denotational semantics of the probabilistic lambda calculus, based on continuous functions over probability distributions as domains. The work mostly appeals to researchers in theoretical computer science focusing on probabilistic programming, randomized algorithms, or programming language theory.

Anbieter: Orell Fuessli CH
Stand: 12.07.2020
Zum Angebot
Constructive Mathematics
61,90 CHF *
ggf. zzgl. Versand

Seidenberg's condition P.- Field extensions.- Dedekind domains.- Effective mathematics ¿ the computer algebra viewpoint.- On some open problems in constructive probability theory.- Consistency and independence results in intuitionistic set theory.- Errata.- Computability of ordinal recursion of type level two.- A constructive approach to classical mathematics.- Remarks on the notion of standard non-isomorphic natural number series.- Reflections on Bishop's philosophy of mathematics.- Formalizing constructive mathematics: Why and how?.- Independence of premisses and the free topos.- An intuitionistic infinitesimal calculus.- Liberal constructive set theory.- Locating metric complements in ?n.- A disjunctive decomposition theorem for classical theories.- Towards a constructive foundation for quantum mechanics.- About infinity, finiteness and finitization (in connection with the foundations of mathematics).- A class of theorems with valid constructive counterparts.- Rational constructive analysis.

Anbieter: Orell Fuessli CH
Stand: 12.07.2020
Zum Angebot
Semantics of the Probabilistic Typed Lambda Cal...
124,99 € *
ggf. zzgl. Versand

This book takes a foundational approach to the semantics of probabilistic programming. It elaborates a rigorous Markov chain semantics for the probabilistic typed lambda calculus, which is the typed lambda calculus with recursion plus probabilistic choice. The book starts with a recapitulation of the basic mathematical tools needed throughout the book, in particular Markov chains, graph theory and domain theory, and also explores the topic of inductive definitions. It then defines the syntax and establishes the Markov chain semantics of the probabilistic lambda calculus and, furthermore, both a graph and a tree semantics. Based on that, it investigates the termination behavior of probabilistic programs. It introduces the notions of termination degree, bounded termination and path stoppability and investigates their mutual relationships. Lastly, it defines a denotational semantics of the probabilistic lambda calculus, based on continuous functions over probability distributions as domains. The work mostly appeals to researchers in theoretical computer science focusing on probabilistic programming, randomized algorithms, or programming language theory.

Anbieter: Thalia AT
Stand: 12.07.2020
Zum Angebot
Constructive Mathematics
41,99 € *
ggf. zzgl. Versand

Seidenberg's condition P.- Field extensions.- Dedekind domains.- Effective mathematics ¿ the computer algebra viewpoint.- On some open problems in constructive probability theory.- Consistency and independence results in intuitionistic set theory.- Errata.- Computability of ordinal recursion of type level two.- A constructive approach to classical mathematics.- Remarks on the notion of standard non-isomorphic natural number series.- Reflections on Bishop's philosophy of mathematics.- Formalizing constructive mathematics: Why and how?.- Independence of premisses and the free topos.- An intuitionistic infinitesimal calculus.- Liberal constructive set theory.- Locating metric complements in ?n.- A disjunctive decomposition theorem for classical theories.- Towards a constructive foundation for quantum mechanics.- About infinity, finiteness and finitization (in connection with the foundations of mathematics).- A class of theorems with valid constructive counterparts.- Rational constructive analysis.

Anbieter: Thalia AT
Stand: 12.07.2020
Zum Angebot