Top "Turing-complete" questions

A model of computation is called Turing-complete if it is capable of simulating a Turing machine.

How useful is Turing completeness? are neural nets turing complete?

While reading some papers about the Turing completeness of recurrent neural nets (for example: Turing computability with neural nets, Hava …

neural-network finite-automata turing-complete state-machine
What are practical guidelines for evaluating a language's "Turing Completeness"?

I've read "what-is-turing-complete" and the wikipedia page, but I'm less interested in a formal proof than in the practical implications …

computer-science language-design turing-complete
Can someone explain Rule 110 in the simplest way possible?

I can't wrap my head around what the Wikipedia article or the answer here say. Can someone explain Rule 110 in …

programming-languages turing-complete
Are makefiles Turing complete?

Lately at work, I've been doing some translation from Makefiles to an alternative build system. I've seen some pretty hairy …

makefile turing-complete
What are the practical limitations of a non-turing complete language like Coq?

As there are non-Turing complete languages out there, and given I didn't study Comp Sci at university, could someone explain …

programming-languages functional-programming turing-complete coq
The type system in Scala is Turing complete. Proof? Example? Benefits?

There are claims that Scala's type system is Turing complete. My questions are: Is there a formal proof for this? …

language-agnostic scala type-systems turing-complete