Inductive Logic Programming (ILP) [1] systems are general purpose learners that have had significant success on solving a number of relational problems, particularly from the biol...
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...
The n-ary first and second recursion theorems formalize two distinct, yet similar, notions of self-reference. Roughly, the n-ary first recursion theorem says that, for any n algo...
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
Abstract: The analysis of RNA folding landscapes yields insights into the kinetic folding behavior not available from classical structure prediction methods. This is especially imp...