|
|
|
|
|
|
by mo_42
1202 days ago
|
|
|
It’s pretty obvious that it can not correctly represent arbitrary transition tables: Just construct a Turing Machine that has a larger transition table than can be encoded in the language model. On the other hand this is just a theoretical argument. Every existing computer is also not a Turing Machine as it has finite memory. |
|
|