Search results for "LIMIT"

Funzione sociale della proprietà

2009

Derived sets and inductive inference

1994

The paper deals with using topological concepts in studies of the Gold paradigm of inductive inference. They are — accumulation points, derived sets of order α (α — constructive ordinal) and compactness. Identifiability of a class U of total recursive functions with a bound α on the number of mindchanges implies \(U^{(\alpha + 1)} = \not 0\). This allows to construct counter-examples — recursively enumerable classes of functions showing the proper inclusion between identification types: EXα⊂EXα+1.

Metric regularity and subdifferential calculus in Banach spaces

1995

In this paper we give verifiable conditions in terms of limiting Frechet subdifferentials ensuring the metric regularity of a multivalued functionF(x)=−g(x)+D. We apply our results to the study of the limiting Frechet subdifferential of a composite function defined on a Banach space.

Single-valued extension property at the points of the approximate point spectrum

2003

Abstract A localized version of the single-valued extension property is studied at the points which are not limit points of the approximate point spectrum, as well as of the surjectivity spectrum. In particular, we shall characterize the single-valued extension property at a point λ o ∈ C in the case that λoI−T is of Kato type. From this characterizations we shall deduce several results on cluster points of some distinguished parts of the spectrum.

AbsolutelyLexpq - Summing Norms of Diagonal Operators inlr and Limit Orders ofLexp - Summing Operators

2001

We compute the absolutely L – summing norms of the diagonal operators acting on lr (1 ≤ q, r < ∞) and determine the limit orders of the absolutely Lexp – summing operators.

Description of the limit set of Henstock–Kurzweil integral sums of vector-valued functions

2015

Abstract Let f be a function defined on [ 0 , 1 ] and taking values in a Banach space X . We show that the limit set I HK ( f ) of Henstock–Kurzweil integral sums is non-empty and convex when the function f has an integrable majorant and X is separable. In the same setting we give a complete description of the limit set.

Probabilistic limit identification up to “small” sets

1996

In this paper we study limit identification of total recursive functions in the case when “small” sets of errors are allowed. Here the notion of “small” sets we formalize in a very general way, i.e. we define a notion of measure for subsets of natural numbers, and we consider as being small those sets, which are subsets of sets with zero measure.

Law of the Iterated Logarithm

2020

For sums of independent random variables we already know two limit theorems: the law of large numbers and the central limit theorem. The law of large numbers describes for large \(n\in \mathbb{N}\) the typical behavior, or average value behavior, of sums of n random variables. On the other hand, the central limit theorem quantifies the typical fluctuations about this average value.

Unified Metrical Common Fixed Point Theorems in 2-Metric Spaces via an Implicit Relation

2013

We prove some common fixed point theorems for two pairs of weakly compatible mappings in 2-metric spaces via an implicit relation. As an application to our main result, we derive Bryant's type generalized fixed point theorem for four finite families of self-mappings which can be utilized to derive common fixed point theorems involving any finite number of mappings. Our results improve and extend a host of previously known results. Moreover, we study the existence of solutions of a nonlinear integral equation.

Parsimony hierarchies for inductive inference

2004

AbstractFreivalds defined an acceptable programming system independent criterion for learning programs for functions in which the final programs were required to be both correct and “nearly” minimal size. i.e.. within a computable function of being purely minimal size. Kinber showed that this parsimony requirement on final programs limits learning power. However, in scientific inference, parsimony is considered highly desirable. Alim-computable functionis (by definition) one calculable by a total procedure allowed to change its mind finitely many times about its output. Investigated is the possibility of assuaging somewhat the limitation on learning power resulting from requiring parsimonio…