• Home
  • Search
  • Universal Generalized Computable Numberings and Hyperimmunity
  • Cite Icon14
  • https://doi.org/10.1007/s10469-017-9454-5Copy DOI Icon

Universal Generalized Computable Numberings and Hyperimmunity

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Generalized computable numberings relative to hyperimmune and high oracles are studied. We give a description of oracles relative to which every finite computable family has a universal computable numbering. Also we present a characterization of the class of oracles relative to which every universal computable numbering of an arbitrary finite family is precomplete, and establish a sufficient condition for universal generalized computable numberings to be precomplete. In addition, we look into the question on limitedness of universal numberings computable relative to high oracles.

Similar Papers
  • Research Article
  • Citations6

General defect relations of holomorphic curves

  • Jan 01, 1985
  • Transactions of the American Mathematical Society
  • Kiyoshi Niino
  • Research Article
  • Citations101

The outliers of a deformed Wigner matrix

  • Sep 01, 2014
  • The Annals of Probability
  • Antti Knowles +1
  • Research Article
  • Citations1

Uniqueness of an independent transversal of a family of sets

  • Nov 01, 1972
  • Mathematical Proceedings of the Cambridge Philosophical Society
  • Richard A Brualdi
  • Research Article
  • Citations74

Viscosity approximation methods for a finite family of nonexpansive mappings in Banach spaces

  • Jan 04, 2006
  • Journal of Mathematical Analysis and Applications
  • Shih-Sen Chang
  • Research Article
  • Citations3

Sur la compatibilité des extensions ponctuelles d'un matroïde

  • Apr 01, 1983
  • Journal of Combinatorial Theory, Series B
  • Raul Cordovil
  • Research Article
  • Citations101

A condition for the stability of switched nonlinear systems

  • Jan 01, 2000
  • IEEE Transactions on Automatic Control
  • J.L Mancilla-Aguilar
  • Research Article
  • Citations1

An Implicit Iteration Process with Errors for a Finite Family of r−strictly Asymptotically Pseudocontractive Mappings

  • Apr 01, 2007
  • Acta Mathematicae Applicatae Sinica, English Series
  • Liang-Gen Hu
  • Research Article
  • Citations1

Strong Convergence for a Finite Family of Generalized Asymptotically Nonexpansive Mappings

  • Jan 01, 2012
  • Physics Procedia
  • Zhi-Hong Ma +1
  • Conference Article
  • Citations1

On the stability and robustness of switched systems

  • Aug 01, 2009
  • Qing Hui
  • Research Article
  • Citations8

Implicit iteration scheme with perturbed mapping for common fixed points of a finite family of Lipschitz pseudocontractive mappings

  • Jan 01, 2007
  • Journal of Mathematical Inequalities
  • Lu-Chuan Ceng +2
  • Research Article
  • Citations1

Syndetically transitive and syndetically sensitive Iterated Function Systems

  • Jul 03, 2018
  • Journal of Dynamical Systems and Geometric Theories
  • E Rezaali +2
  • Research Article
  • Citations1

On Guaspari's problem about partially conservative sentences

  • Jan 05, 2022
  • Annals of Pure and Applied Logic
  • Taishi Kurahashi +3
  • Research Article

Composite Implicit Iteration Process for Two Finite Families of Generalized Asymptotically Quasi-Nonexpansive Mappings

  • Dec 30, 2013
  • Numerical Functional Analysis and Optimization
  • Liping Yang +1
  • Book Chapter

Explicit Iteration Scheme with Perturbed Mapping for Common Xed Points of a Nite Family of I -Asymptotically Nonexpansive Mappings

  • Jan 01, 2012
  • Lingmin Zhang +3
  • Conference Article
  • Citations1

Path-Complete Lyapunov Functions for Continuous-Time Switching Systems

  • Oct 19, 2020
  • Matteo Della Rossa +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.