Abstract We study the fine-grained complexity of NP-complete, infinite-domain constraint satisfaction problems (CSPs) parameterised by a set first-order definable relations (with equality). Such CSPs are central importance since they form subclass any CSP over relational structure (possibly containing more than just prove that under randomised exponential-time hypothesis it is not possible to f...

Domain theory is ‘a mathematical theory that serves as a foundation for the semantics of programming languages’ [AJ94]. Domains form the basis of a theory of partial information, which extends the familiar notion of partial function to encompass a whole spectrum of “degrees of definedness”, so as to model incremental higher-order computation (i.e., computing with infinite data values, such as f...

Domain theory is ‘a mathematical theory that serves as a foundation for the semantics of programming languages’ [AJ94]. Domains form the basis of a theory of partial information, which extends the familiar notion of partial function to encompass a whole spectrum of “degrees of definedness”, so as to model incremental higher-order computation (i.e., computing with infinite data values, such as f...

Abstract A characterization of a semilinear elliptic partial differential equation (PDE) on bounded domain in R n is given terms an infinite-dimensional dynamical system. The system the space boundary data for PDE. This novel approach to problems that enables use systems tools studying corresponding ill-posed, meaning solutions do not exist forwards or backwards time generic initial data. We of...

Based on a new approximation method, namely pseudospectral method, a solution for the three order nonlinear ordinary differential laminar boundary layer Falkner-Skan equation has been obtained on the semi-infinite domain. The proposed approach is equipped by the orthogonal Hermite functions that have perfect properties to achieve this goal. This method solves the problem on the semi-infinite do...