No clue why the thread is closed just because I made clear that the domino-problem is not solveable.
Anyway, feel free to discuss it. I wont interact much anymore, only when someone is asking me for my reply.
That is why I give one important thing(that I hoped to be able to work out with you but I fail) right on the way, probably it makes someone like Kejardon think about it:
I think Gödel (great mathematician) had found something substantial: A formal system cannot prove all true statements
Now some can claim that computation can probably do more than that.
Here is my response to it by an example which makes my arguments a bit more visible:
So some may ask what has this simple small domino-problem to do all with that?
It is the same core that it is not possible to constuct a compiler that is able to detect all possible infinite loops for all source-codes.
My claim is:
It is also the same core for a happening that every ordinary person is familiar with: performing tasks by given specifications. Such tasks a person can do can all differ in specifications and are infinite in their number.
Now if this happening is computational, there should also exist a possibility for a computer-program that can take any specification as input and produce a program that performs the according task (a program that again generates such task-solving-programs).
Like it was mentioned before the compiler-problem is already not computational.
So here is something to think about.
Of course it doesnt mean we cannot create 'intelligent' or strong problem-solving-systems. Very much can be done. Only life is a big story. The key to act wisely is mainly to limit your specifications to relevant problems. Btw. for example for those who watched my Smart-Ray-vid, the specification here was to design a language which describes arbitary adaptive-movement-patterns and also a program that again generates such individual ray-programs. I actually managed to reduce the programs to scripts:)
Anyway, feel free to discuss it. I wont interact much anymore, only when someone is asking me for my reply.
That is why I give one important thing(that I hoped to be able to work out with you but I fail) right on the way, probably it makes someone like Kejardon think about it:
I think Gödel (great mathematician) had found something substantial: A formal system cannot prove all true statements
Now some can claim that computation can probably do more than that.
Here is my response to it by an example which makes my arguments a bit more visible:
So some may ask what has this simple small domino-problem to do all with that?
It is the same core that it is not possible to constuct a compiler that is able to detect all possible infinite loops for all source-codes.
My claim is:
It is also the same core for a happening that every ordinary person is familiar with: performing tasks by given specifications. Such tasks a person can do can all differ in specifications and are infinite in their number.
Now if this happening is computational, there should also exist a possibility for a computer-program that can take any specification as input and produce a program that performs the according task (a program that again generates such task-solving-programs).
Like it was mentioned before the compiler-problem is already not computational.
So here is something to think about.
Of course it doesnt mean we cannot create 'intelligent' or strong problem-solving-systems. Very much can be done. Only life is a big story. The key to act wisely is mainly to limit your specifications to relevant problems. Btw. for example for those who watched my Smart-Ray-vid, the specification here was to design a language which describes arbitary adaptive-movement-patterns and also a program that again generates such individual ray-programs. I actually managed to reduce the programs to scripts:)
Thread title: