algorithms, artificial intelligence

AI Skeptics

I am talking about those goalpost-moving crowd which says “You will be never able to make computers play chess!”. When computers do chess, they just move this goal to something else unachievable according to them, like Go. Pretending meanwhile, how trivial the chess was. It’s just an algorithm, they say.

It’s a well-known hypocrisy of this particular sect, nothing new here. But can we somehow use this pile of dishonest intellectual garbage for something interesting and informative?

Let me try! Until we have no algorithm, we have an open and “impossible” AI problem. Then, we have at least an lousy algorithm. Then we have a better algorithm. Then we have a superhuman level solving algorithm. Therefore, one day we will have the so-called AGI, when we will have one billion or more algorithms stacked so nifty, that they will trigger the most promising one among them, to solve any problem which may appear. A new algorithm will be devised when needed. In their free time, all those algorithms will be under optimization process and re-stacked often. Every aspect of this algorithm-hive will be the subject of a constant effort to improve.

And this we will call AGI. The above-mentioned skeptic club will call it “an increasingly large pile of self-improving algorithms for various tasks, nothing new”.




algorithms, artificial intelligence

Doctors and nurses and such …

… are notoriously difficult to schedule.  The right amount of them at every moment of the day or night, each working at some acceptable pace, about the right number of hours per month, with various absences, holidays and much more is a par excellence hard to plan.

If is it more chess-like complicated or Go-like complicated, depends on a particular working place in question, but it’s almost always complicated!  Human schedulers are surprisingly good, as human chess players are surprisingly good. But only to a point when the machine with the algorithm arrives. A human is no match for the top engines.

There is a superhuman level scheduler called WoShi now. Partly responsible for the hiatus we had on this blog. We are field testing it right now.




Coin Flipping Problem

Elo from LessWrong suggested this problem:

I write a sequence of n heads or tails on paper.

I then start flipping a sequence of n coins. If next coin does not match my sequence, I restart a new sequence of n coins.

What is the rule for the relationship between how many coins I need to flip to get the sequence I have pre-committed to and the length of the sequence of?

Discussion there:


Sleeping Beauty Problem Variant

Say, it’s you who is the Sleeping Beauty, awaken and told by the dungeon master:

Here is a fair coin. I will toss it and if it lands head up, your memories will be erased and you will be put to sleep again and then you’ll wake up after some time in this exactly the same scenario.

If the coin lands tails up, however, you’ll get this fair coin to play with as long as you wish. After then, you will be asked for a number. If that number is equal to the number of times you have been awakened like this, you will be freed.

If your number isn’t right, your memories will be erased and you will be put to sleep again and then you’ll wake up after some time in this exactly the same scenario.

What is your strategy to be freed? If not this time, but eventually?

You know that this dungeon master is telling you the truth. So this may be your first time or the second or the Nth time.

What is your best strategy to escape?

Talk about it here: