Results 261 to 270 of about 380,262 (318)

Finite-dimensional regulators for a class of infinite-dimensional systems.

Schumacher, J.M.
core  

Infinite Paths to Infinite Reality

, 2018
Sri Ramakrishna is widely known as a nineteenth-century Indian mystic who affirmed the harmony of all religions on the basis of his richly varied spiritual experiences and eclectic religious practices, both Hindu and non-Hindu. In Infinite Paths to Infinite Reality, Ayon Maharaj argues that Sri Ramakrishna was also a sophisticated philosopher of great ...
Maharaj, Ayon
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Computing with Infinite Terms and Infinite Reductions

Fundamenta Informaticae, 2019
We define computable infinitary rewriting by introducing computability to the study of strongly convergent infinite reductions over infinite first-order terms. Given computable infinitary reductions, we show that descendants and origins—essential to proving fundamental properties such as compression and confluence—are computable ...
Ketema, Jeroen, Simonsen, Jakob Grue
openaire   +2 more sources

Infinite sequences and infinite series

1977
It is customary to use expressions such as $${u_1} + {u_2} + \cdots + {u_n} + \cdots ,\;and\;\sum\limits_{n = 1}^\infty {{u_n}}$$ (9.1) to represent infinite series. The u i are called the terms of the series, and the quantities $${s_n} = {u_1} + {u_2} + \cdots + {u_n},\quad n = 1,2, \ldots ,$$ are called the partial sums of the series.
Murray H. Protter, Charles B. Morrey
openaire   +1 more source

Infinite kernel learning via infinite and semi-infinite programming

Optimization Methods and Software, 2010
As data become heterogeneous, multiple kernel learning methods may help to classify them. To overcome the drawback lying in its (multiple) finite choice, we propose a novel method of 'infinite' kernel combinations for learning problems with the help of infinite and semi-infinite optimizations. Looking at all the infinitesimally fine convex combinations
Süreyya Özögür-Akyüz, Gerhard-Wilhelm Weber   +1 more
openaire   +3 more sources

On infinite series of infinite isols

The Journal of Symbolic Logic, 1988
We are interested in regressive isols, recursive functions, and the extensions of recursive functions to the isols. One of the nicest concepts that has been applied to the study of these notions is of an infinite series of isols . J. C. E.
openaire   +2 more sources

Infinite subscripts from infinite exponents

Journal of Symbolic Logic, 1984
Definition. For ordinals α ≤ κ, = [X]α = {p ⊆ X ∣ ot (p) = α}. For α ≤, κ, κ a cardinal, holds iff for every partition F: [Κ]κ → A, there is an X ∈ [Κ]κ with F constant on [X]α. X is called homogeneous for F. When A = 2 the subscript is omitted.It has been known since the sixties that for finite exponents all such properties are equivalent, i.e., κ ...
James E. Baumgartner, James M. Henle
openaire   +1 more source

Infinite terms and infinite rewritings

1991
We discuss here the properties of term rewriting systems that allow infinite derivations leading to infinite normal forms. We extend work of Dershowitz and Kaplan to preserve more information about infinite derivations in the resulting normal forms, and to give finite representations of cyclic infinite terms.
Yiyun Chen, Michael J. O'Donnell
openaire   +1 more source