15 search results - page 1 / 3 » Speed-Up Theorems in Type-2 Computation |
CIE
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
MFCS
1990
Springer
13 years 8 months ago
1990
Springer
CSL
2007
Springer
13 years 10 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
IFIP
2004
Springer
13 years 9 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
FOCI
2007
IEEE
13 years 10 months ago
2007
IEEE
Abstract— Centroid, cardinality, fuzziness, variance and skewness are all important concepts for an interval type-2 fuzzy set (IT2 FS) because they are all measures of uncertaint...