Tuple relational calculus...

Halting in non-Turing-complete languages...

Is C++ preprocessor metaprogramming Turing-complete?...

Really minimum lisp...

Can a language be turing complete but incomplete in other ways?...

What is the reason for a Turing complete type system...

Requirements for optimal time complexity for every algorithm?...

Looking for languages that are not Turing complete...

Some inference about NP...

Language class compilable to heapless runtime...

Are Perl regexes turing complete?...

Why does the y-combinator provide Turing equivalence?...

What can awk do that sed can't?...

How did Haskell add Turing-completeness to System F?...

Is Wolfram Language a true programming language?...

Turing completeness of lambda calculus?...

Are .NET's regular expressions Turing complete?...

Can someone explain Rule 110 in the simplest way possible?...

Are makefiles Turing complete?...

Generally, is it possible to write kinect-like app using only C++?...

Is the Starbucks menu Turing Complete?...

Is C# 4.0 compile-time turing complete?...

Is my program Turing-complete?...

What elegant and Turing-complete machines* you know? Is there a one from The Book?...

How does this implementation of turing-complete Rule 110 in HTML5+CSS3 work?...

Which property of Scala's type-system make it Turing-complete?...

Consequences of inability to add natural numbers in C...

Is a dictionary turing complete...

What makes people think that NNs have more computational power than existing models?...

Is it possible to write a self-interpreting FSM or Pushdown Automaton?...