In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
A novel way to simulate Turing Machines (TMs) by Artificial Neural Networks (ANNs) is proposed. We claim that the proposed simulation is in agreement with the correct interpretatio...
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
-An edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or to all of the perfect matchings of H. It is shown that a connected plane bipartite gra...
We study the relationship between least and inflationary fixed-point logic. In 1986, Gurevich and Shelah proved that in the restriction to finite structures, the two logics have t...