![]() Hirst, T., Harel, D.: Completeness Results for Recursive Databases. on Foundations of Computer Science, Syracuse, New York (October 1980) 309–318 (April 1979)Ĭhandra, A.K., Harel, D.: Structure and Complexity of Relational Queries. on Theory of Computing, Atlanta, Georgia, pp. Special Turing Centennial printing (2012)Ĭhandra, A.K., Harel, D.: Computable Queries for Relational Data Bases. Oxford University Press (2000) Revised paperback edition, 2003. Harel, D.: Computers Ltd.: What They Really Can’t Do. Rice, H.G.: Classes of recursively enumerable sets and their decision problems. Turing, A.M.: On Computable Numbers with an Application to the Entscheidungsproblem. ![]() Merton, R.K.: On The Shoulders of Giants: A Shandean Postscript.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |