Results 281 to 290 of about 16,529,293 (335)
Some of the next articles are maybe not open access.
Degrees bounding minimal degrees
Mathematical Proceedings of the Cambridge Philosophical Society, 1989A set is called n-generic if it is Cohen generic for n-quantifier arithmetic. A (Turing) degree is n-generic if it contains an n-generic set. Our interest in this paper is the relationship between n-generic (indeed 1-generic) degrees and minimal degrees, i.e.
Chong, C. T., Downey, R. G.
openaire +2 more sources
Siberian Mathematical Journal, 1975
For one partial function to be partial recursive in another requires a partial recursive operator; this relation yields the partial degrees [see \textit{H. Rogers jun.}, Theory of recursive functions and effective computability. Maidenhead, Berksh.: McGraw-Hill Publishing Company, Ltd. (1967; Zbl 0183.01401)].
openaire +2 more sources
For one partial function to be partial recursive in another requires a partial recursive operator; this relation yields the partial degrees [see \textit{H. Rogers jun.}, Theory of recursive functions and effective computability. Maidenhead, Berksh.: McGraw-Hill Publishing Company, Ltd. (1967; Zbl 0183.01401)].
openaire +2 more sources
On C-Degrees, H-Degrees and T-Degrees
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007Following a line of research that aims at relating the computation power and the initial segment complexity of a set, the work presented here investigates into the relations between Turing reducibility, defined in terms of computation power, and C-reducibility and H-reducibility, defined in terms of the complexity of initial segments.
Wolfgang Merkle, Frank Stephan
openaire +1 more source
Degree-problems I squarefree character degrees
Archiv der Mathematik, 1985Let \(G\) be a finite group with the property that all its irreducible complex characters have squarefree degrees. The authors show that in the case of \(G\) being solvable there are universal bounds for the derived length and the nilpotent length of \(G\), which are 4 and 3, respectively; if \(G\) is nonsolvable they show that \(G\) is the direct ...
Huppert, Bertram, Manz, Olaf
openaire +1 more source
Nursing Standard, 2016
A British nurse who survived the Ebola virus has received an honorary degree from the University of Essex.
openaire +2 more sources
A British nurse who survived the Ebola virus has received an honorary degree from the University of Essex.
openaire +2 more sources
The degree of frailty as a translational measure of health in aging
Nature Aging, 2021S. Howlett, A. Rutenberg, K. Rockwood
semanticscholar +1 more source
On \(1\)-degrees inside \(m\)-degrees
2021This paper gives a partial answer to a question of \textit{P. Odifreddi} [Bull. Am. Math. Soc., New Ser. 4, 37--86 (1981; Zbl 0484.03024)]: If a c.e. \(m\)-degree contains more than one \(1\)-degree, must it contain an infinite antichain of \(1\)-degrees (i.e. a chain of pairwise incomparable degrees)? \textit{A. N.
openaire +1 more source
Degrees of Efficiency and Degrees of Minimality
SIAM Journal on Control and Optimization, 2003Summary: We characterize different types of solutions of a vector optimization problem by means of a scalarization procedure. Usually different scalarizing functions are used in order to obtain the various solutions of the vector problem. Here we consider different kinds of solutions of the same scalarized problem.
openaire +2 more sources
Piecewise polynomial, positive definite and compactly supported radial functions of minimal degree
Advances in Computational Mathematics, 1995H. Wendland
semanticscholar +1 more source