An element f of a commutative ring A with identity element is called a von Neumann regular element if there is a g in A such that fg = f . A point p of a (Tychonoff) space X is called a P -point if each f in the ring C(X) of continuous realvalued functions is constant on a neighborhood of p. It is well-known that the ring C(X) is von Neumann regular ring iff each of its elements is a von Neuman...

A bstract We describe an algebra of observables for a static patch in de Sitter space, with operators gravitationally dressed to the worldline observer. The is von Neumann Type II 1 . There natural notion entropy state such algebra. maximum state, which corresponds empty and any semiclassical algebras agrees, up additive constant independent expected generalized S gen = ( A/ 4 G N ) + out An ar...

Developing energy-efficient parallel information processing systems beyond von Neumann architecture is a long-standing goal of modern information technologies. The widely used von Neumann computer architecture separates memory and computing units, which leads to energy-hungry data movement when computers work. In order to meet the need of efficient information processing for the data-driven app...

we show that every semi-artinian module which is contained in a direct sum of finitely presented modules in $si[m]$, is weakly co-semisimple if and only if it is regular in $si[m]$. as a consequence, we observe that every semi-artinian ring is regular in the sense of von neumann if and only if its simple modules are $fp$-injective.

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

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...