Andreas Polyméris

Learn More
We study the computational complexity of an important property of simple, regular and weighted games, which is decisiveness. We show that this concept can naturally be represented in the context of hypergraph theory, and that decisiveness can be decided for simple games in quasipolynomial time, and for regular and weighted games in polynomial time. The(More)
We propose a new formal model of cognitive structures and offer a first analysis of their mathematical complexity features. The structures we consider should have response-ability in all — but only in— the situations they experience. Therefore they have to be coherent, but not necessarily complete. Our understanding of knowledge is constructivistic and thus(More)
We have built an adaptive system (AS) that is able to evolve and improve its answering ability to all reiterative questions from an artificial environment. Indeed, we have created a basic artificial system that is able to do what is usually understood as a natural system's behavior. In this work, rather than using logic, we encourage coherence, because it(More)
  • 1