Let (X, d, ) be a partially ordered metric space. Let F, G be two set valued mappings and f , g two single valued mappings on X . We obtained sufficient conditions for existence of common fixed point of F , G, f and g satisfying an implicit relation in X .

Objective: The purpose of this paper is to prove some common fixed-point theorems satisfying the rational type contractive condition in frame work complex valued b metric spaces. Methodology: Some well-known result we studied –metric spaces and replaced constant by control function obtain new fixed point also proving uniqueness for a pair mappings. Findings: Results based on are derived context...

In this paper, the natural gradient descent method for the multilayer stochastic complex-valued neural networks is considered, and the natural gradient is given for a single stochastic complex-valued neuron as an example. Since the space of the learnable parameters of stochastic complex-valued neural networks is not the Euclidean space but a curved manifold, the complex-valued natural gradient ...

Using the notion of formal ball, we present a few new results in the theory of quasi-metric spaces. With no specific order: every continuous Yoneda-complete quasi-metric space is sober and convergence Choquet-complete hence Baire in its d-Scott topology; for standard quasi-metric spaces, algebraicity is equivalent to having enough center points; on a standard quasi-metric space, every lower sem...

The purpose of this paper is to study common fixed point theorems for six (four single-valued and two set-valued) mappings in fuzzy metric spaces. without assuming compatibility and continuity of any mapping on non complete metric spaces. To prove the theorem, we use a non compatible condition, that is, weak commutativity of type (Kh)in fuzzy metric spaces. We show that completeness of the whol...

It is known that dimension of a set in a metric space can be characterized in information-related terms – in particular, in terms of Kolmogorov complexity of different points from this set. The notion of Kolmogorov complexity K(x) – the shortest length of a program that generates a sequence x – can be naturally generalized to conditional Kolmogorov complexity K(x : y) – the shortest length of a...