Topic
Computability
About: Computability is a research topic. Over the lifetime, 2829 publications have been published within this topic receiving 85162 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: This paper considers systems of parameterized affine recurrence equations, that is to say, systems ofRecurrence equations whose domains depend linearly on a size parameter, and establishes that the computability of such system is also undecidable.
35 citations
Journal Article•
TL;DR: This work proposes an alternative but semantically equivalent perspective based on a generalization of results relating to the database-theoretic problem of answering queries using views, which leads to a fast query rewriting algorithm, which has been implemented and experimentally evaluated.
Abstract: We address the problem of answering queries using expressive symmetric inter-schema constraints which allow to establish mappings between several heterogeneous information systems. This problem is of high relevance to data integration, as symmetric constraints are essential for dealing with true concept mismatch and are generalizations of the kinds of mappings supported by both local-as-view and global-as-view approaches that were previously studied in the literature. Moreover, the flexibility gained by using such constraints for data integration is essential for virtual enterprise and e-commerce applications. We first discuss resolution-based methods for computing maximally contained rewritings and characterize computability aspects. Then we propose an alternative but semantically equivalent perspective based on a generalization of results relating to the database-theoretic problem of answering queries using views. This leads to a fast query rewriting algorithm based on AI techniques, which has been implemented and experimentally evaluated.
35 citations
TL;DR: A domain-theoretic approach to recursive analysis is used to develop the basis of an effective and realistic framework for solid modelling equipped with a well defined and realistic notion of computability which reflects the observable properties of real solids.
35 citations
TL;DR: A possible model, constituting a chaotic dynamical system, is presented, which is term as the analog shift map, when viewed as a computational model has super-Turing power and is equivalent to neural networks and the class of analog machines.
34 citations
16 Sep 2008
TL;DR: The Computability Path Ordering (CPO) as discussed by the authors is a termination proof method for higher-order recursive path ordering, for which an improved definition is given in this paper.
Abstract: In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path Ordering. This new definition appears indeed to capture the essence of computability arguments a la Tait and Girard, therefore explaining the name of the improved ordering.
34 citations