Abstract
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hidemore information of what is usually expressed in theirrespective statements. We make this information explicit, allowing to state stronger, complexity theoretic-versions of all these theorems. In particular, we replace the notion of extensional set of indices of programs, by a set of indices of programs having not only the same extensional behavior but also similar complexity (Complexity Clique). We prove, under very weak complexity assumptions, that any recursive Complexity Clique is trivial, and any r.e. Complexity Clique is an extensional set (and thus satisfies Rice-Shapiro conditions). This allows, for instance, to use Rice's argument to prove that the property of having polynomial complexity is not decidable, and to use Rice-Shapiro to conclude that it is not even semi-decidable. We conclude the paper with a discussion of "complexity-theoretic" versions of Kleene's Fixed Point Theorem.
- R. Amadio. Synthesis of max-plus quasi interpretations. Fundamenta Informaticae 65 (2005), pp 29--60. IOS Press. Google Scholar
Digital Library
- A. Asperti, A. Ciabattoni. Effective applicative structures. In Proceedings the sixth biannual conference on Category Theory in Computer Science (CTCS'95), volume 953, pp. 158--174, 1995. Google Scholar
Digital Library
- A. Asperti, L. Roversi. Intuitionistic Light Affine Logic (Proof-nets, Normalization Complexity, Expressive Power). ACM Transactions on Computational Logic (TOCL), Volume 3, Issue 1, January 2002, pp. 137--175. Google Scholar
Digital Library
- M. Blum. A machine-independent theory of the complexity of recursive functions. Journal of ACM, 14(2), pp. 322--336, April 1967. Google Scholar
Digital Library
- M. Blum. On effective procedures for speeding up algorithms. Journal of ACM, 18(2), pp.290--305, April 1971. Google Scholar
Digital Library
- E. Börger. Berechenbarkeit, Komplexität, Logik. Friedr. Vieweg & Sohn, Braunshweig, 1986.Google Scholar
- A. Borodin. Computational complexity and the existence of complexity gaps. Journal of ACM, 19, pp. 158--174, March 1972. Google Scholar
Digital Library
- N. J. Cutland. Computability: An Introduction to Recursive Function Theory. Cambridge University Press, Cambridge, UK, 1986.Google Scholar
- U. Dal Lago, P. Baillot. On light logics, uniform encodings and polynomial time. Mathematical Structures in Computer Science, V.16, Issue 4, pp. 713--733, August 2006. Google Scholar
Digital Library
- J.C.E. Dekker and J. Myhill. Some theorems on classes of recursively enumerable sets. Trans. Amer. Math. Soc., 89, pp. 25--59, 1958.Google Scholar
Cross Ref
- P. Freyd, P. Mulry, G. Rosolini, and D. Scott. Extensional pers. Information and Computation, 98(2), pp. 211--227, June 1992. Google Scholar
Digital Library
- T.A. Hansen, T. Nikolajsen, J.L. Träff, and N.D. Jones. Experiments with implementations of two theoretical constructions. In Logic at Botik, volume 363, pages 119--133, 1989. Google Scholar
Digital Library
- J. Hartmanis and R.E. Stearns. On the computational complexity of algorithms. Trans. Amer. Math. Soc., 117, pp. 285--306, 1965.Google Scholar
Cross Ref
- Neil D. Jones. Constant time factors do matter. In Proceedings of STOC'93, pp. 602--611, 1993. Google Scholar
Digital Library
- D. Kozen. Indexing of subrecursive classes. Theoretical Computer Science, 11, pp. 277--301, 1980.Google Scholar
Cross Ref
- L.H. Landweber and E.L. Robertson. Recursive properties of abstract complexity classes. Journal of ACM, 19(2), pp. 296--308, April 1972. Google Scholar
Digital Library
- F.D. Lewis. Unsolvability considerations in computational complexity. In Proceedings of Second ACM Symp. on Theory of Computing, pp. 22--30, 1970. Google Scholar
Digital Library
- G. Lischke. Über die erfüllung gewisser erhaltungssätze durch kompliziertheitsmasse. Zeit. Math. Log. Grund. Math., 21, pp. 159--166, 1975.Google Scholar
Cross Ref
- G. Lischke. Natürliche kompliziertheitsmasse und erhaltungssätze i. Zeit. Math. Log. Grund. Math., 22, pp.413--418, 1976.Google Scholar
Cross Ref
- G. Lischke. Natürliche kompliziertheitsmasse und erhaltungssätze ii. Zeit. Math. Log. Grund. Math., 23, pp. 193--200, 1977.Google Scholar
Cross Ref
- E.M. McCreight and A.R. Meyer. Classes of computable functions defined by bounds on computation. In Proceedings of ACM Symp. on Theory of Computing, Marina del Rey, Calif., pp. 79--88, 1969. Google Scholar
Digital Library
- J. Myhill, J.C. Shepherdson. Effective operations on partial recursive functions. Zeit. Math. Log. Grund. Math., 1, pp.310--317, 1955.Google Scholar
Cross Ref
- P.G. Odifreddi. Classical Recursion Theory: the Theory of Functions and Sets of Natural Numbers, volume 125 of Studies in Logic and the Foundations of Mathematics. Elsevier, 1997.Google Scholar
- P.G. Odifreddi. Classical Recursion Theory, Volume II, volume 143 of Studies in Logic and the Foundations of Mathematics. Elsevier, 1999.Google Scholar
- J.G. Rice. Classes of recursively enumerable set and their decision problems. Trans. Amer. Math. Soc., 74, pp.358--366, 1953.Google Scholar
Cross Ref
- H. Rogers. Theory of Recursive Functions and Effective Computability. MIT press, 1987. Google Scholar
Digital Library
- N. Shapiro. Degrees of computability. Transactions of the American Mathematical Society, 82, pp.281--299, 1956.Google Scholar
Cross Ref
- P.R. Young. Toward a theory of enumeration. Journal of ACM, 16(2), pp. 328--348, 1969. Google Scholar
Digital Library
Index Terms
The intensional content of Rice's theorem
Recommendations
The intensional content of Rice's theorem
POPL '08: Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesThe proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hidemore information of what is usually expressed in theirrespective statements. We make this information explicit, allowing to state stronger, ...
The decidability of the intensional fragment of classical linear logic
Intensional classical linear logic (MELL) is proved decidable.Intensional interlinear logic (RLL) is proved decidable.We adapt Kripke's method used to prove decidability for some relevance logics.The semi-relevant RLL emerges as a logic superior to MELL ...







Comments