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
0
votes
0 answers

Is Functional Complete means Turing Complete?

I noticed that AND, OR, NOT those three logic gates are Functionally Complete, it means I can represent any trues table only by those three gates. So, I want to know whether I can represent any computable function only by those three gates ?
Yachao Zhu
  • 21
  • 1
0
votes
1 answer

Turing Completeness in the real world

Real programs can solve problems given enough time and space. For every problem instance of known size, there is fixed upper bound on the amount of space which is consumed. Are there problems that cannot be solved (i.e. functions which cannot be…
Matei
  • 152
  • 1
  • 5
0
votes
1 answer

Requirements for optimal time complexity for every algorithm?

The time complexity of algorithms can differ from programming language to programming language in which it is implemented, because of certain things not possible to be done in one language as opposed to the other. Turing-completeness also doesn't…
Koekje
  • 677
  • 1
  • 6
  • 17
0
votes
2 answers

Why would a Scripting language be made 'purposefully Turing non-complete'?

So, I was reading about Bitcoin Script on their official documentation and found this line: "Script is simple, stack-based, and processed from left to right. It is purposefully not Turing-complete, with no loops." I tried to reason hard but couldn't…
Anoop Dixith
  • 633
  • 2
  • 8
  • 20
0
votes
4 answers

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

I am trying to find the logical alan turing explanation why there can't be a program that checks another programs. I remember we learned in on the computation course but now i just can't find the solution , and i need to explain it to some one at…
Night Walker
  • 20,638
  • 52
  • 151
  • 228
0
votes
2 answers

Why does the y-combinator provide Turing equivalence?

This answer says Here is a basic y-combinator in lambda calculus: Y f = (\x -> f (x x)) (\x -> f (x x)) Ie Something like this in Clojure: (defn Y [f] ((fn [x] (x x)) (fn [x] (f (fn [& args] (apply (x x) args)))))) (def fac …
hawkeye
  • 34,745
  • 30
  • 150
  • 304
0
votes
1 answer

Is Wolfram Language a true programming language?

Wolfram is about to release its "knowledge based programming language" but is it really a true programming language in the same way as C#, Java etc? To avoid this being too subjective, I'll clarify that by "true programming language" I mean: is it…
JosephByrne
  • 123
  • 7
0
votes
1 answer

Can a Turing machine decide if a formal model of computation is Turing complete?

That is, can a Turing machine take a formal system, S, as its input and decide if S is Turing complete? I think this is an undecidable problem, am I right? If it is undecidable, why can we (as humans) decide Turing completeness?
Jack McKay Fletcher
  • 129
  • 8
-1
votes
0 answers

Programming languages more than turing complete?

I read about turing complete from this answer. From what I understood, for a programming language to be turing complete it should be able to compute everything a turing machine can. Lets consider Python. I know for a fact that Python is turing…
Mike
  • 9
  • 3
-1
votes
1 answer

Could you mine cryptocurrencies with the LaTeX language?

Since LaTeX is Turing Complete it is clearly possible, albeit very inefficient, but would it be remotely feasible as a stunt? Moreover, is it currently being done or has there been a proof of work/concept?
Gerben Koopman
  • 1
  • 1
-6
votes
1 answer

Is HTML5 turing complete?

I would like to know if it's possible to do that? Thank you
DigitalDisaster
  • 467
  • 3
  • 10
  • 25
1 2 3 4 5 6 7
8