| ▲ | purple_turtle 2 days ago | |||||||
Maybe technically LLM can be converted to an equivalent Markov Chain. The problem is that even for modest context sizes the size of Markov Chain would by hilariously and monstrously large. You may as well tell that LLM and a hash table is the same thing. | ||||||||
| ▲ | a day ago | parent | next [-] | |||||||
| [deleted] | ||||||||
| ▲ | thaumasiotes a day ago | parent | prev [-] | |||||||
As I just mentioned in the comment you're responding to, the way you convert an LLM into an equivalent Markov chain is by doing nothing, since it already is one. > You may as well tell that LLM and a hash table is the same thing. No. You may as well say that a hash table and a function are the same thing. And this is in fact a common thing to say, because they are the same thing. An LLM is a significantly more restricted object than a function is. | ||||||||
| ||||||||