4 ms·
This is pretty much 100% false. There are known trivial Turing machines (which can be implemented in matrix multiplications) that are intelligent. They just do
by lostmsu 3y ago
This is pretty much 100% false.
There are known trivial Turing machines (which can be implemented in matrix multiplications) that are intelligent. They just don't think fast enough to be of any use.
- nmilo 3y agoExample?
- klyrs 3y agoWithout offering anything to anybody trying to characterize "intelligence," I do like silly languages. FRACTRAN is integer×rational multiplication in a double for-loop. Not an exact match, but if you work in a factorized representation, I think you can massage the integer×rational into a matrix multiplication.
- version_five 3y agoI'd guess he's misunderstanding some of the finite automata?
- lostmsu 3y agoI can not find the better variant that was more theoretical with exhaustiveness theorem, but on the practical side this applies to more or less any symbolic system that performs tree search among statements. E.g. https://en.m.wikipedia.org/wiki/Logic_Theorist https://en.m.wikipedia.org/wiki/Logic_Theorist