Stack Overflow
Stack Overflow

Questions tagged [turing-complete]

A model of computation is called Turing-complete if it is capable of simulating a Turing machine. Programming languages that are Turing complete are at least as powerful as the most powerful models of feasible computation yet theorized.

A Turing Complete system means a system in which a program can be written that will find an answer (although with no guarantees regarding runtime or memory) 1.

116 questions
36
votes
8 answers

What logic gates are required for Turing completeness?

My son has been playing Little Big Planet 2 lately, and I noticed that the game editor allows AND gates, OR gates and NOT gates... Is it Turing complete? If so, can anyone recommend a source for learning to turn those primitives into something like…
dicroce
  • 45,396
  • 28
  • 101
  • 140
34
votes
4 answers

Is it possible to create a quine in every turing-complete language?

I just wanted to know if it is 100% possible, if my language is turing-complete, to write a program in it that prints itself out (of course not using a file reading function) So if the language just has the really necessary things in order to make…
sub
  • 2,653
  • 3
  • 27
  • 29
30
votes
11 answers

Creating the shortest Turing-complete interpreter

I've just tried to create the smallest possible language interpreter. Would you like to join and try? Rules of the game: You should specify a programming language you're interpreting. If it's a language you invented, it should come with a list of…
ilya n.
  • 18,398
  • 15
  • 71
  • 89
27
votes
1 answer

What is the reason for a Turing complete type system

Scala and Haskell have "Turing complete type systems". Usually, Turing completeness refers to computations and languages. What does it really mean in the context of types? Could some one give an example of how a programmer can benefit from it? PS I…
Sayat Satybald
  • 6,300
  • 5
  • 35
  • 52
27
votes
3 answers

What are the six basic primitives in Turing Complete

I am listening the edX lesson, and the professor stresses that every machine able to perform those six basic primitives can be called Turing Complete. But what are the six basic primitives?
YourTeddy
  • 413
  • 2
  • 5
  • 8
25
votes
1 answer

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

Scala uses a type-system based on System F ω, which is normally said to be strongly normalizing. Strongly normalizing implies non-Turing completeness. Nevertheless, Scala's type-system is Turing-complete. Which changes/additions/modifications make…
soc
  • 27,983
  • 20
  • 111
  • 215
25
votes
2 answers

Why is mov turing complete?

I found this recently: https://github.com/xoreaxeaxeax/movfuscator It seems to be contingent on the fact that mov is turing-complete. Is that true, and why?
schuelermine
  • 1,958
  • 2
  • 17
  • 31
24
votes
4 answers

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 simple terms? How does it guarantee Turing completeness?
Anirudh Ramanathan
  • 46,179
  • 22
  • 132
  • 191
15
votes
3 answers

Halting in non-Turing-complete languages

The halting problem cannot be solved for Turing complete languages and it can be solved trivially for some non-TC languages like regexes where it always halts. I was wondering if there are any languages that has both the ability to halt and not…
Shalmanese
  • 5,254
  • 10
  • 29
  • 41
14
votes
2 answers

Turing completeness of lambda calculus?

How do you argue for the fact that lambda calculus is Turing complete (in the simplest way possible) ?
samsamara
  • 4,630
  • 7
  • 36
  • 66
14
votes
6 answers

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

My understanding is that it means that one can potentially write a program to formally prove that a program written in a statically typed language will be free of a certain (small) subset of defects. My problem with this is as follows: Assume that…
aaronasterling
  • 68,820
  • 20
  • 127
  • 125
13
votes
4 answers

Criteria to determine if it's a programming language

What are the critera or the basic features required to tell that X or Y is (or is not) a programming language? I've done some reading (Is HTML considered a programming language?, Turing complete, and others), and came to the conclusion that a…
Jérôme
  • 26,567
  • 29
  • 98
  • 120
13
votes
7 answers

Is conditional branching a requirement of Turing-completeness?

I've been searching the web and I'm finding somewhat contradictory answers. Some sources assert that a language/machine/what-have-you is Turing complete if and only if it has both conditional and unconditional branching (which I guess is kind of…
David Titarenco
  • 32,662
  • 13
  • 66
  • 111
13
votes
2 answers

Is my program Turing-complete?

I spent a week or two programming a simple logic solver. Having built it, I found myself wondering whether the language it solves is Turing-complete or not. So I coded up a small set of equations which accept any valid expression in the SKI…
MathematicalOrchid
  • 61,854
  • 19
  • 123
  • 220
12
votes
4 answers

Are .NET's regular expressions Turing complete?

Regular expressions are often pointed to as the classical example of a language that is not Turning complete. For example "regular expressions" is given in as the answer to this SO question looking for languages that are not Turing complete. In my,…
Robert
  • 6,407
  • 2
  • 34
  • 41
1
2
3 4 5 6 7 8