The techniques introduced are applied to various problems in multi-agent systems. The book is written for advanced students and professionals interested in multi-agent systems or, more generally, in distributed artificial intelligence and constraint satisfaction. Researchers active in the area will appreciate this book as a valuable source of reference. Occam We generalize Kolmogorov complexity and study the fastest way of computing all computable objects, with consequences for inductive inference, Occam's razor, and the big picture. This might be of interest to machine learners, theoretical computer scientists, mathematicians, physicists, and philosophers.
All comments are welcome.
We assume P is formally describable.