This article presents a generalization of the equilibrium analysis for the simple two-player poker game with alternate bidding of Von Neumann and Morgenstern. It approximates optimal play for this game if it is played with a regular deck of 52 cards and it discusses some strategic insights. In addition, the paper studies the relative skill level of this game.

We introduce C∗-pseudo-multiplicative unitaries and (concrete) Hopf C∗-bimodules, which are C∗-algebraic variants of the pseudo-multiplicative unitaries on Hilbert spaces and the Hopf-von Neumann-bimodules studied by Enock, Lesieur, and Vallin [5, 6, 4, 10, 19, 20]. Moreover, we associate to every regular C∗-pseudo-multiplicative unitary two Hopf-C∗bimodules and discuss examples related to loca...

In this paper it is shown that two-dimensional cellular automata with Von Neumann neighborhoods are not suitable for cryptographic purposes. This result is obtained after analyzing the most important cryptographic properties of boolean functions defining their local transition rules 2000 Mathematics Subject Classifications: 68Q80, 94A60, 94C10

In von Neumann 29-state cellular automata, the crossing of signals is an important problem, with three solutions reported in the literature. These solutions greatly impact automaton design, especially self-replicators. This paper examines these solutions, with emphasis upon their constructibility. We show that two of these solutions are difficult to construct, and offer an improved design techn...

The celebrated von Neumann minimax theorem is a fundamental theorem in two-person zero-sum games. In this paper, we present a generalization of the von Neumann minimax theorem, called robust von Neumann minimax theorem, in the face of data uncertainty in the payoff matrix via robust optimization approach. We establish that the robust von Neumann minimax theorem is guaranteed for various classes...

Let $mathcal M$ be a factor von Neumann algebra. It is shown that every nonlinear $*$-Lie higher derivation$D={phi_{n}}_{ninmathbb{N}}$ on $mathcal M$ is additive. In particular, if $mathcal M$ is infinite type $I$factor, a concrete characterization of $D$ is given.

When the computer scientist seeks to model natural phenomena, he or she may select from two paths. Modeling may be by representation or by realization. This distinction is clarified by means of a simple physical example: an adiabatic pressure vessel. A representational model will in no way involve the operation of such a vessel even as a real gas law is observed (like van der Waals’ gas law), w...

“The von Neumann vicious circle” means that non-von Neumann computer architectures cannot be developed because of the lack of widely available and effective non-von Neumann languages. New languages cannot be created because of lack of conceptual foundations for non-von Neumann architectures. The reason is that programming languages are high-level abstract isomorphic copies of von Neumann comput...