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
11
votes
1 answer

Is Ansible Turing Complete?

Ansible offers many filters and conditionals. As far as I can tell; it should be possible to implement an Ansible playbook that executes a set of tasks that achieve the same outcome as a Turing Complete language. So, is it Turing Complete?
Karim Tabet
  • 1,789
  • 1
  • 14
  • 35
11
votes
4 answers

Are LINQ expression trees Turing complete?

As they are in .Net 3.5. I know they are in 4.0, as that's what the DLR works with, but I'm interested in the version we have now.
TraumaPony
  • 10,742
  • 12
  • 54
  • 74
10
votes
10 answers

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

For example, are there certain things when writing an operating system that cannot be accomplished in a turing complete language?
McGovernTheory
  • 6,556
  • 4
  • 41
  • 75
10
votes
4 answers

Really minimum lisp

What is the minimum set of primitives required such that a language is Turing complete and a lisp variant? Seems like car, cdr and some flow control and something for REPL is enough. It be nice if there is such list. Assume there are only 3 types of…
Chao Xu
  • 2,156
  • 2
  • 22
  • 31
9
votes
2 answers

Looking for languages that are not Turing complete

I know a little about what is a turing-machine and a turing-complete language, but to understand better, could someone give examples of languages that are not Turing complete? (maybe even machines that are not Turing, as well?)
The Student
  • 27,520
  • 68
  • 161
  • 264
9
votes
1 answer

Is C# 4.0 compile-time turing complete?

There is a well-known fact that C++ templates are turing-complete, CSS is turing-complete (!) and that the C# overload resolution is NP-hard (even without generics). But is C# 4.0 (with co/contravariance, generics etc) compile-time turing complete?
wizzard0
  • 1,883
  • 1
  • 15
  • 38
7
votes
1 answer

Datalog computational class?

Datalog is not Turing complete. But what is its computational class? Is it equivalent to Finite state machine or Pushdown machine (i.e. context free) ... or is it something in between?
Mustafa
  • 931
  • 1
  • 13
  • 26
7
votes
2 answers

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

I'm reading an article about different evaluation strategies (I linked article in wiki, but I'm reading another one not in English). And it says that unlike to call-by-name and call-by-need strategies, call-by-value strategy is not Turing…
Roman
  • 64,384
  • 92
  • 238
  • 332
7
votes
8 answers

Can these sorts of programs exist in every Turing-complete language?

In every Turing-Complete language, is it possible to create a working Compiler for itself which first runs on an interpreter written in some other language and then compiles it's own source code? (Bootstrapping) Standards-Compilant C++ compiler…
I can't tell you my name.
  • 209
  • 1
  • 3
7
votes
2 answers

Tuple relational calculus

Is safe tuple relational calculus a turing complete language?
Sailaja
  • 141
  • 5
6
votes
2 answers

Is C++ preprocessor metaprogramming Turing-complete?

I know C++ template metaprogramming is Turing-complete. Does the same thing hold for preprocessor metaprogramming?
HighCommander4
  • 50,428
  • 24
  • 122
  • 194
6
votes
2 answers

Will Scala 3 not be Turing complete?

I attended the following keynote on the future of Scala by Martin Odersky: https://skillsmatter.com/skillscasts/8866-from-dot-to-dotty At 1:01:00 an answer to an audience question seems to say that future Scala will not be Turing complete. Did I…
Mario Galic
  • 47,285
  • 6
  • 56
  • 98
6
votes
2 answers

Is VHDL Turing complete?

Is VHDL Turing complete? My understanding is that VHDL creates a register machine, and that register machines - without arbitrary RAM - aren't Turing complete. Is this accurate? For problems that can't be solved in register machines, is there a…
SRobertJames
  • 8,210
  • 14
  • 60
  • 107
6
votes
2 answers

Is there a programming language that only has the power of a deterministic push-down automata, and no more?

Some programming problems don't require the full power of a Turing machine to solve. They can be solved with much less power. I am seeking a programming language with lesser power. Does there exist a high-level programming language that is…
Roger Costello
  • 3,007
  • 1
  • 22
  • 43
5
votes
3 answers

Turing machine for addition and comparison of binary numbers

Good Day everyone! I am trying to solve this Exercise for learning purpose. Can someone guide me in solving these 3 questions? Like I tried the 1st question for addition of 2 binary numbers separated by '+'. where I tried 2 numbers addition by…
Muhammad Asif Raza
  • 647
  • 2
  • 5
  • 24
1 2
3
4 5 6 7 8