Results 1 
7 of
7
Theories With SelfApplication and Computational Complexity
 Information and Computation
, 2002
"... Applicative theories form the basis of Feferman's systems of explicit mathematics, which have been introduced in the early seventies. In an applicative universe, all individuals may be thought of as operations, which can freely be applied to each other: selfapplication is meaningful, but not ne ..."
Abstract

Cited by 12 (9 self)
 Add to MetaCart
Applicative theories form the basis of Feferman's systems of explicit mathematics, which have been introduced in the early seventies. In an applicative universe, all individuals may be thought of as operations, which can freely be applied to each other: selfapplication is meaningful, but not necessarily total. It has turned out that theories with selfapplication provide a natural setting for studying notions of abstract computability, especially from a prooftheoretic perspective.
A ProofTheoretic Characterization of the Basic Feasible Functionals
 Theoretical Computer Science
, 2002
"... We provide a natural characterization of the type two MehlhornCookUrquhart basic feasible functionals as the provably total type two functionals of our (classical) applicative theory PT introduced in [27], thus providing a proof of a result claimed in the conclusion of [27]. ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
We provide a natural characterization of the type two MehlhornCookUrquhart basic feasible functionals as the provably total type two functionals of our (classical) applicative theory PT introduced in [27], thus providing a proof of a result claimed in the conclusion of [27].
Asymptotic behaviors of type2 algorithms and induced baire topologies
 In Proceedings of the Third International Conference on Theoretical Computer Science
, 2004
"... 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) is not acceptable in type2 context, we alter the notion of “small sets ” from “finiteness ” to topological “compactne ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
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) is not acceptable in type2 context, we alter the notion of “small sets ” from “finiteness ” to topological “compactness ” for type2 complexity theory. A natural reference for type2 computations is the standard Baire topology. However, we point out some serious drawbacks of this and introduce an alternative topology for describing compact sets. Following our notion explicit type2 complexity classes can be defined in terms of resource bounds. We show that such complexity classes are recursively representable; namely, every complexity class has a programming system. We also prove type2 analogs of Rabin’s Theorem, Recursive Relatedness Theorem, and Gap Theorem to provide evidence that our notion of type2 asymptotic is workable. We speculate that our investigation will give rise to a possible approach in examining the complexity structure at type2 along the line of the classical complexity theory. Keywords: Type2 Complexity, Type2 Asymptotic Notation, Baire Topology. 1.
Weak theories of operations and types
"... This is a survey paper on various weak systems of Feferman’s explicit mathematics and their proof theory. The strength of the systems considered in measured in terms of their provably terminating operations typically belonging to some natural classes of computational time or space complexity. Keywor ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
This is a survey paper on various weak systems of Feferman’s explicit mathematics and their proof theory. The strength of the systems considered in measured in terms of their provably terminating operations typically belonging to some natural classes of computational time or space complexity. Keywords: Proof theory, Feferman’s explicit mathematics, applicative theories, higher types, types and names, partial truth, feasible operations 1
Clocking type2 computation in the unit cost model
 In Proceedings of Computability in Europe: Logical Approach to Computational Barriers
, 2006
"... Abstract. In [12] we defined a class of functions called Type2 Time Bounds (henceforth T2TB) for clocking the Oracle Turing Machine (OTM) in order to capture the long missing notion of complexity classes at type2. In the present paper we further advance the type2 complexity theory under our notio ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. In [12] we defined a class of functions called Type2 Time Bounds (henceforth T2TB) for clocking the Oracle Turing Machine (OTM) in order to capture the long missing notion of complexity classes at type2. In the present paper we further advance the type2 complexity theory under our notion of type2 complexity classes. We have learned that the theory is highly sensitive to how the oracle answers are handled. We present a reasonable alternative called unit cost model, and examine how this model shapes the outlook of the type2 complexity theory. Under the unit cost model we prove two theorems opposite to the classical union theorem and gap theorem. We also investigate some properties of T2TB including a very useful theorem stating that there is an effective operator to convert any β ∈ T2TB into an equivalent one that is lockingdetectable. The existence of such operator allows us to simplify many proofs without loss of generality. 1 1
The Analysis of Programming Structure
 ACM SIGACT News
, 1997
"... This paper has explored three examples of good semantical analyses of programming structures. The three examples share two characteristics: the semantic models are abstract enough to be applicable in many situations, and the models lead to proofs of noncomputability. Other examples of programming s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper has explored three examples of good semantical analyses of programming structures. The three examples share two characteristics: the semantic models are abstract enough to be applicable in many situations, and the models lead to proofs of noncomputability. Other examples of programming structures have been omitted from this short essay: foundations for objectoriented languages, descriptions of languages with local variables, and the theory of database query languages. Each of these examples have corresponding semantical theories that enjoy the two characteristics above. The richness of programming structure suggests a corollary: it is folly to look for one universal model to explain all programming structures. Of course, as a theoretical subject, semantics benefits from the reduction of many concepts to a primitive, common level. Nevertheless, reduction must often be resisted. We have seen how computability theory loses all kinds of relevant distinctions. Another example is the naive semantics of PCF based on dcpos: the model is not abstract enough,
Feasibly Continuous TypeTwo Functionals
, 1997
"... A wellknown theorem of typetwo recursion theory states that a functional is continuous if and only if it is computable relative to some oracle. We show that a feasible analogue of this theorem holds, using techniques originally developed in the study of Boolean decision tree complexity. 1 Introduc ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A wellknown theorem of typetwo recursion theory states that a functional is continuous if and only if it is computable relative to some oracle. We show that a feasible analogue of this theorem holds, using techniques originally developed in the study of Boolean decision tree complexity. 1 Introduction Typetwo computability theory deals with the computability of functionals, which take functions and numbers as input, and produce numbers as output. A surprising and pleasing aspect of typetwo computability is its close connections with topology on Baire space. Notions of relative typetwo computability (that is, computability with respect to some oracle,) can be characterized using purely topological notions. In particular, a typetwo functional is computable relative to an oracle if and only if it is continuous. While the theory of typetwo computability has been widely successful, relatively little work has been done on the development of a complexity theory for typetwo functionals...