On a relation between uniform coding and problems of the form DTIMEF ( F ) = ? DSPACEF ( F ) Salvatore
نویسندگان
چکیده
If uniform coding (Gödelization) of potentially infinite sequences of numbers can be performed in PSPACEF, then PSPACE = EXPTIME 6= EXPSPACE = 2-EXPTIME, and, for all p, we have p−EXPSPACE = p+1-EXPTIME; if it can be performed in LINSPACEF, we also have LINSPACE = DTIME(2); the proof fails, when relativized to oracle-TM’s. A by-product of this research is that PTIMEF is not closed under number-theoretic, limited, course-of-values recursion.
منابع مشابه
Implicit Computational Complexity and the Exponential Time-Space Classes
We extend the Implicit Computational Complexity program, promoted by Leivant and by other scholars, to all complexity classes DTIMESPACEF(f(n), g(n)), between DTIMEF(n) and DSPACEF(nn c ). Let clps(α, n) denote the result of replacing ω by n in Cantor normal form for α < ωω ω . A hierarchy T Sαβ is defined by means of a very restricted form of substitution, and of two un-limited operators (simu...
متن کاملA Hierarchy of Imperative Languages for the Feasible Classes DTIMEF(n) and for the Superexponential Classes DTIMEF(n)
An imperative programming language is defined by closure of a free word-algebra of de/con-structors under two new operators (simultaneous safe recurrence and constructive diagonalization). By assigning ordinals to its programs a transfinite hierarchy of imperative languages is introduced which singles-out the feasible classes DTIMEF(n) and the superexponential classes DTIMEF(kn). Key–Words: Imp...
متن کاملProperties of fuzzy relations and aggregation process in decision making
In this contribution connections between input fuzzy relations R1, . . . ,Rn on a set X and the output fuzzy relationRF = F(R1, . . . ,Rn) are studied. F is a function of the form F : [0, 1]n → [0, 1] and RF is called an aggregated fuzzyrelation. In the literature the problem of preservation, by a function F, diverse types of properties of fuzzy relationsR1, . . . ,Rn is examined. Here, it is c...
متن کاملA Complete Bibliography of Publications in Acta Informatica
(n, k) [370]. (N − 1) [1203]. + [1117, 903]. 0 [349, 852]. 1 [32, 939, 293, 778, 516, 916, 607, 563, 548, 946, 231, 852, 578]. 1, 1 [488]. 2 [1234, 1246, 737, 714, 715, 313, 788, 92, 166, 202]. 2.5n [535]. 3 [1234, 313, 92, 202]. 7 [1141]. ∗ [466]. α− β [235]. α2 [1355]. B [515]. B∗ [442]. B [680]. mod5 [1141]. P [1090]. QH [1090]. D [1209, 401, 136, 1078, 1017, 1185]. DTIMEF(F) =?DSPACEF(F) [1...
متن کاملA method to obtain the best uniform polynomial approximation for the family of rational function
In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...
متن کامل