2 ms·
It can do something but I wouldn’t call it reasoning. IMO a reasoning algorithmic must be more complex than a lookup table.
by zeroonetwothree 1y ago
It can do something but I wouldn’t call it reasoning. IMO a reasoning algorithmic must be more complex than a lookup table.
- int_19h 1y agoWe were talking about a "sufficiently large" table, which means that it can be larger than realistic hardware allows for. Any algorithm operating on bounded memory can be ultimately encoded as a finite state automaton with the table defining all valid state transitions.