Abstract
This paper gives a precise characterization for the complexity of the problem of proving equal two streams defined with a finite number of equations: Π0 over 2. Since the Π 0 over 2 class includes properly both the reursively enumerable and the corecursively enumerable classes, this result implies that neither the set of pairs of equal streams nor the set of pairs of unequal streams is recursively enumerable. Consequently, one can find no algorithm for determining equality of streams, as well as no algorithm for determining inequality of streams. In particular, there is no complete proof system for equality of streams and no complete system for inequality of streams.
- F. Baader and T. Nipkow. Term rewriting and all that. Cambridge University Press, New York, NY, USA, 1998.]] Google Scholar
Digital Library
- J. Bergstra and J.V. Tucker. Equational specifications, complete term rewriting systems, and computable and semicomputable algebras. Journal of the Association for Computing Machinery, 42(6):1194--1230, 1995.]] Google Scholar
Digital Library
- M. Bidoit, R. Hennicker, and A. Kurz. Observational logic, constructor-based logic, and their duality. Theoretical Computer Science, 3(298):471--510, 2003.]] Google Scholar
Digital Library
- S. Buss and G. Roşu. Incompleteness of behavioral logics. In H. Reichel, editor, Proceedings of Coalgebraic Methods in Computer Science (CMCS'00), Berlin, Germany, March 2000, volume 33 of Electronic Notes in Theoretical Computer Science, pages 61--79. Elsevier Science, 2000.]]Google Scholar
- H. Geuvers. Inductive and coinductive types with iteration and recursion. In B. Nordström, K. Pettersson, and G. Plotkin, editors, Informal Proceedings Workshop on Types for Proofs and Programs, Båstad, Sweden, 8-12 June 1992, pages 193--217. Dept. of Computing Science, Chalmers Univ. of Technology and Göteborg Univ., 1992.]]Google Scholar
- J. Goguen. Types as theories. In G.M. Reed, A.W. Roscoe, and R.F. Wachter, editors, Topology and Category Theory in Computer Science, pages 357--390. Oxford, 1991.]] Google Scholar
Digital Library
- J. Goguen and G. Malcolm. A hidden agenda. Theoretical Computer Science, 245(1):55--101, 2000.]] Google Scholar
Digital Library
- R. Hennicker. Context induction: a proof principle for behavioral abstractions. Formal Aspects of Computing, 3(4):326--345, 1991.]]Google Scholar
Cross Ref
- R. Kennaway, J.W. Klop, M.R. Sleep, and F.-J. de Vries. Transfinite reductions in orthogonal term rewriting systems. Inf. Comput., 119(1):18--38, 1995.]] Google Scholar
Digital Library
- G. Roşu. Hidden Logic. PhD thesis, University of California at San Diego, 2000.]]Google Scholar
- G. Roşu. Equality of streams is a Π 0 over 2-complete problem. Technical Report UIUCDCS-R-2006-2708, University of Illinois at Urbana-Champaign, Department of Computer Science, Apr. 2006.]]Google Scholar
- G. Roşu and J. Goguen. Hidden congruent deduction. In R. Caferra and G. Salzer, editors, Automated Deduction in Classical and Non-Classical Logics. Springer, 2000. Lecture Notes in Artificial Intelligence, Volume 1761.]] Google Scholar
Digital Library
- H. Rogers Jr. Theory of Recursive Functions and Effective Computability. MIT press, Cambridge, MA, 1987.]] Google Scholar
Digital Library
- J. Rutten. A tutorial on coinductive stream calculus and signal flow graphs. Journal of Theoretical Computer Science, pages 443--481, Oct. 2005.]] Google Scholar
Digital Library
Index Terms
Equality of streams is a Π0 over 2-complete problem
Recommendations
Equality of streams is a Π0 over 2-complete problem
ICFP '06: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programmingThis paper gives a precise characterization for the complexity of the problem of proving equal two streams defined with a finite number of equations: Π0 over 2. Since the Π 0 over 2 class includes properly both the reursively enumerable and the ...
Characterizing memory requirements for queries over continuous data streams
This article deals with continuous conjunctive queries with arithmetic comparisons and optional aggregation over multiple data streams. An algorithm is presented for determining whether or not any given query can be evaluated using a bounded amount of ...
Challenges for Event Queries over Markovian Streams
Building applications on top of sensor data streams is challenging because sensor data is noisy. A model-based view can reduce noise by transforming raw sensor streams into streams of probabilistic state estimates, which smooth out errors and gaps. The ...







Comments