๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

BOUNDS IN THE TURING REDUCIBILITY OF FUNCTIONS

โœ Scribed by Karol Habart; K. Habart

Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
374 KB
Volume
38
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

A hierarchy of functions with respect to their role as bounds in the Turing reducibility of functions is introduced and studied. This hierarchy leads to a certain notion of incompressibility of sets which is also investigated.

๐Ÿ“œ SIMILAR VOLUMES

On the stable rank and reducibility in a
On the stable rank and reducibility in algebras of real symmetric functions
โœ R. Rupp; A. Sasane ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 172 KB

## Abstract Let __A__~โ„~(๐”ป) denote the set of functions belonging to the disc algebra having real Fourier coefficients. We show that __A__~โ„~(๐”ป) has Bass and topological stable ranks equal to 2, which settles the conjecture made by Brett Wick in [18]. We also give a necessary and sufficient conditi

New Bounds on the Zeros of Spline Functi
New Bounds on the Zeros of Spline Functions
โœ T.N.T. Goodman ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 230 KB

We show that, subject to a certain condition, the number of zeros of a spline function is bounded by the number of strong sign changes in its sequence of B-spline coefficients. By writing a general spline function as a sum of functions which satisfy the given condition, we can deduce known bounds on

Sharp Bounds for the Ratio of q โ€“ Gamma
Sharp Bounds for the Ratio of q โ€“ Gamma Functions
โœ Horst Alzer ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 148 KB ๐Ÿ‘ 2 views

Let ฮ“q (0 < q = 1) be the q -gamma function and let s โˆˆ (0, 1) be a real number. We determine the largest number ฮฑ = ฮฑ(q, s) and the smallest number ฮฒ = ฮฒ(q, s) such that the inequalities hold for all positive real numbers x. Our result refines and extends recently published inequalities by Ismail

Lower Bounds for the Complexity of Funct
Lower Bounds for the Complexity of Functions in a Realistic RAM Model
โœ Nader H. Bshouty ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 127 KB

This paper develops a new technique that finds almost tight lower bounds for the complexity of programs that compute or approximate functions in a realistic RAM model. The nonuniform realistic RAM model is a model that uses the arithmetic ร„ 4 operations q, y, = , the standard bit operation Shift, Ro