A while back I wrote about language modeling without neural networks, where I generated Shakespeare with an unbounded n-gram model: no weights, no training, …
  • hirihit640@sh.itjust.worksEnglish
    4·
    3 days ago

    that’s probably generalized too far and reaches into pseudo-science.

    Just understand the concept of Turing-completeness, and the idea that many systems are Turing equivalent.