Simple vs. Nested...

What does it mean for a language to be statically typed?...

The type system in Scala is Turing complete. Proof? Example? Benefits?...

A naive questioin about UML and Turing completeness...

Why call-by-value evaluation strategy is not Turing complete?...

why there can't be a program that checks another program...

How could a quine in my programming language look?...

How can I simulate a turing machine?...

Can a language be Turing-complete without any support for arrays?...