NP-complete problems are particularly hard to solve. Unless P=NP, any algorithm solving an NP-complete problem takes exponential time in the worst case. The intrinsic difficulty of NP-complete problems when we try to optimally solve them with compute
Eden is a parallel extension of the functional language Haskell. On behalf of parallelism Eden overrides Haskell's pure lazy approach, combining a non-strict functional application with eager process creation and eager communication. We desire to investigate alternative semantics for Eden in order to analyze the consequences of some of the decisions adopted during the language design. In this paper we show how to implement in Maude the operational semantics of Eden in such a way that semantic rules can be modified easily. Moreover, other semantic features can be implemented by means of parameterized modules that allow to instantiate in different ways several parameters of the semantics but without modifying the semantic rules
In this paper we present an experiment designed to test whether an automatic system can learn a set of rules in a similar way as human beings learn the same set of rules. In order to do that, we have conducted two experiments. The first of them has been done with a group of seventy people, while the second one has been done by running an automatic learning system designed by ourselves. The paper contains the results of both tests, and a comparison of the learning curves of both types of subjects: humans and automatic agents. We also analyze the differences and similarities by considering how humans and agents construct their knowledge about the rules. By using both types of analysis, we study how close is the learning process of our automatic agents to obtaining a success in a Turing test.
1 January 2003 in Lecture Notes in Computer Science