منابع مشابه
Elementary Non-Archimedean Representations of Probability for Decision Theory and Games
In an extensive form game, whether a player has a better strategy than in a presumed equilibrium depends on the other players’ equilibrium reactions to a counterfactual deviation. To allow conditioning on counterfactual events with prior probability zero, extended probabilities are proposed and given the four equivalent characterizations: (i) complete conditional probability systems; (ii) lexic...
متن کاملProspects for a Theory of Non-archimedean Expected Utility: Impossibilities and Possibilities
In this talk I examine the prospects for a theory of probability aspiring to support a decisiontheoretic interpretation by which principles of probability derive their normative status in virtue of their relationship with principles of rational decision making. More specifically, I investigate the possibility of a theory of expected utility abiding by distinguished dominance principles which ha...
متن کاملNon-Archimedean Ergodic Theory and Pseudorandom Generators
The paper develops techniques in order to construct computer programs, pseudorandom number generators (PRNG), that produce uniformly distributed sequences. The paper exploits an approach that treats standard processor instructions (arithmetic and bitwise logical ones) as continuous functions on the space of 2-adic integers. Within this approach, a PRNG is considered as a dynamical system and is...
متن کاملDirect Images in Non-archimedean Arakelov Theory
In this paper we develop a formalism of direct images for metrized vector bundles in the context of the non-archimedean Arakelov theory introduced in our joint work [BGS] with S. Bloch, and we prove a Riemann-Roch-Grothendieck theorem for this direct image. The new ingredient in the construction of the direct image is a non archimedean " analytic torsion current ". Let K be the fraction field o...
متن کاملThe Non-Archimedean Theory of Discrete Systems
In the paper, we study behaviour of discrete dynamical systems (automata) w.r.t. transitivity; that is, speaking loosely, we consider how diverse may be behaviour of the system w.r.t. variety of word transformations performed by the system: We call a system completely transitive if, given arbitrary pair a, b of finite words that have equal lengths, the system A, while evolution during (discrete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Social Sciences
سال: 2009
ISSN: 0165-4896
DOI: 10.1016/j.mathsocsci.2008.12.009