A story about how people are prepared or not for a new paradigm In this world no one is able to ensure that he really is capable of leading a paradigm shift. Whether it is really taking place or is just an illusion. …

A first approach to understand how to connect them — Imagine that you have a mechanism that, even manually, allows you to connect any quantified Boolean expression to a simple expression without quantifiers.

From the point of view of the computer scientist, the schedules are the structures that can give more war, in consideration with the little academic documentation that there is on the matter. That’s the reason for this and so many other posts I’ve published in Medium. There is an enormous…

The Assignment Problem is a very known mathematical problem which has some very tested implementations. Here I will expose this first step to construct a School Timetable, which is not so easy. Each timetable or schedule is constructed in different ways considering the kind of problem we have to consider…

A data Scientist must train himself with the Pandas to obtain a good working with the DataFrames. So in this post I will expose you how we can implement a structure which can be used to work with databases in another point of view. For that purpose, here it is…

How to guess things with minimum information

Here I propose a new structure based in the way I ensure I solved Boolean Satisfiability designed specifically for QAP — The Quadratic Assignment Problem is a problem that serves many purposes. From determining where to install machines, large installations…, or even helping to place products in department stores to encourage consumption. After doing a study of matrices calculation, and observing how I explain the boolean satisfiability, in the corresponding article…

Imagine that your client is a non-profit association that wants to organize a championship among its teenagers. Imagine that you have been…

Decide if it were or not possible, or even intractable — It’s not true that we can calculate anything we propose with a computer. This is something that was discovered 100 years ago. No matter what notation is chosen, there are problems where you can’t be sure that a machine can conclude with an answer. The problems that cannot be associated…