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”.

Fine.

 

 

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.

 

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:

http://lesswrong.com/r/discussion/lw/pd5/open_thread_august_28_september_3_2017/dwkw

 

 

Easier Chess Problem

There is a black queen on the chess board. How many white queens (or how many knights) are needed to take it? No other pieces present, white to move, the black queen is not under attack yet.

Discussion at:

http://lesswrong.com/r/discussion/lw/pa0/open_thread_july_24_july_30_2017/dvo9

4D Mate Problem

Imagine a black chess king  on a 4D chessboard. 8 by 8 by 8 by 8 hypercubes. How many white queens do you need to mate this king, which tries to escape, of course. White doesn’t have a king, just the minimal necessary pack of queens. What is the mating algorithm? Legal moves are analogous to those of 2D chess.

Discussion over there:

http://lesswrong.com/lw/p8a/open_thread_july_10_july_16_2017/dv76

Huffman Codes Problem

Possible, essentially different from each other,  Huffman codes for 5 letters A,B,C,D,E are these 3:

0, 10, 110, 1110, 1111
0, 100, 101, 110, 111
00, 01, 10, 110, 111

 

For all the English alphabet, 26 letters, from A to Z, what are the possible Huffman codes?

EDIT:

Discussion:

http://lesswrong.com/r/discussion/lw/p7c/open_thread_jul_03_jul_09_2017/duwv

 

Create 2314

This is how you create the number 7.

MakeIntVar A
Inc A
Inc A
A=A*A
A=A+A
Dec A

Or

MakeIntVar A
MakeIntVar B
Inc A
Inc B
Shl A, A
Shl A, A
A=A-B

You can do all the basic operations + – * \ and you can shift right and left, and decrease or increase any variable, which you have to “MakeIntVar” first. By doing that, the variable is initialized to zero.

Now, make 2314 with the shortest possible algorithm.

Intermezzo Problem’s Solution Isn’t Quite Cooked Yet

The (computer)  cooking is under way now, for several hours already.

Cell-600 Bulk (Hypervolume)?

1. Edge is 1, what’s the hypervolume?
2. General formula for the bulk?

The solution for 1 can be obtained numerically.

For 2, you have time until the end of this year (2017). (Unless the solution will be published sooner than that.)

“Web Search Schelling Point”

Shall be here.