Jesper Agdakx 🔸Oh hey, Asterisk has an article on theorem provers, LLMs, and autoformalization (i.e. automatically turning math papers into formalized proofs). I still think this task is significantly more difficult than what some people seem to think, but who can really tell anymore at this point.<br><br><a href="https://asteriskmag.com/issues/09/automating-math" rel="nofollow noopener noreferrer" target="_blank">asteriskmag.com/issues/09/automating-math</a><br><br><a class="hashtag" href="https://agda.club/tag/theoremprovers" rel="nofollow noopener noreferrer" target="_blank">#TheoremProvers</a> <a class="hashtag" href="https://agda.club/tag/coq" rel="nofollow noopener noreferrer" target="_blank">#Coq</a> <a class="hashtag" href="https://agda.club/tag/lean" rel="nofollow noopener noreferrer" target="_blank">#Lean</a> <a class="hashtag" href="https://agda.club/tag/isabelle" rel="nofollow noopener noreferrer" target="_blank">#Isabelle</a>