Skip to main content
Computer Science

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

4
  • $\begingroup$ Doesn't the linked question answer your question? Perhaps I'm not understanding what your question is or why the answers there didn't meet your needs. $\endgroup$ Commented Jan 4, 2021 at 6:42
  • $\begingroup$ From what I could understand, they were mostly talking about why people use Turing completeness as a basis of computation, but I'm curious as to how this was proven/supposed. It may answer that question, but I certainly didn't understand the answer :) $\endgroup$ Commented Jan 4, 2021 at 14:40
  • $\begingroup$ Are you asking how to prove that a particular functional programming language is Turing-complete? If so it would help to tell us which one you want to see a proof for. Have you looked at turing-completeness to look through the resources there? It basically amounts to writing code for a simulator of a Turing machine (or of any other Turing-complete language), which can get a little bit boring... $\endgroup$ Commented Jan 4, 2021 at 20:25
  • $\begingroup$ thanks, thats very helpful, can u put it as an answer so I can accept $\endgroup$ Commented Jan 5, 2021 at 0:06