Search results for "Crete"
showing 10 items of 2495 documents
Inductive Inference with Procrastination: Back to Definitions
1999
In this paper, we reconsider the definition of procrastinating learning machines. In the original definition of Freivalds and Smith [FS93], constructive ordinals are used to bound mindchanges. We investigate possibility of using arbitrary linearly ordered sets to bound mindchanges in similar way. It turns out that using certain ordered sets it is possible to define inductive inference types different from the previously known ones. We investigate properties of the new inductive inference types and compare them to other types.
On the number of Arnoux–Rauzy words
2002
On the behaviour of measures of noncompactness with respect to differentiation and integration of vector-valued functions
1983
Criteria for the solubility and non-simplicity of finite groups
2005
Abstract Some criteria of the non-simplicity of a finite group by graph theoretical terms are derived. This is then used to establish conditions under which a finite group is soluble.
A note on renewal systems
1992
Abstract A renewal system is a symbolic dynamical system generated by free concatenations of a finite set of words. In this paper we prove that, given two systems which are both renewal and Markov systems, it is decidable whether they are topologically conjugate. The proof makes use of the methods and the techniques of formal language theory.
A remark on extrapolation of rearrangement operators on dyadic Hs, 0< s ≤1
2005
Links modulo knots and the isotopic realization problem
2001
Fixed Point Theorems with Applications to the Solvability of Operator Equations and Inclusions on Function Spaces
2015
1Department of Mathematics, King Abdulaziz University, P.O. Box 80203, Jeddah 21589, Saudi Arabia 2Department of Mathematical Analysis, University of Valencia, Spain 3Centre Universitaire Polydisciplinaire, Kelaa des Sraghna, Morocco 4Universite Cadi Ayyad, Laboratoire de Mathematiques et de Dynamique de Populations, Marrakech, Morocco 5Department of Mathematics and Computer Science, University of Palermo, Via Archirafi 34, 90123 Palermo, Italy
On the Existence of 1-Bounded Bi-ideals with the WELLDOC Property
2015
A combinatorial condition called well distributedoccurrences, or WELLDOC for short, has been introducedrecently. The proofs that WELLDOC property holds for thefamily of Sturmian words, and more generally, for Arnoux-Rauzy words are given in two papers by Balkova et al. The WELLDOC property for bounded bi-ideals is analysed inthis paper. The existence of a 1-bounded bi-ideal over thefinite alphabet that satisfies the WELLDOC property has beenproved by the authors.
Selmer's Multiplicative Algorithm
2011
Abstract.The behavior of the multiplicative acceleration of Selmer's algorithm is widely unknown and no general result on convergence has been detected yet. Solely for its 2-dimensional, periodic expansions, there exist some results on convergence and approximation due to Fritz Schweiger. In this paper we show that periodic expansions of any dimension do in fact converge and that the coordinates of the limit points are rational functions of the largest eigenvalue of the periodicity matrix.