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
1
vote
4 answers

Turing completeness

So one can say a language is Turing complete if it meets some criteria, and it can do anything another Turing complete language can do. Does that mean I can theoretically implement Google using JavaScript or Brainf_ck?
maniac
  • 27
  • 5
1
vote
1 answer

Unrolling procedural code into SQL

The act of transforming procedural code into SQL has been of interest to me lately. I know that not absolutely everything is expressable in a turing complete procedural language. What if you have a special purpose procedural language though? For…
Earlz
  • 62,085
  • 98
  • 303
  • 499
1
vote
1 answer

What is the simplest Turing complete CPU instruction set which can execute code from ROM?

I believe that all the OISCs below, require that programs are executed from RAM, in order to be Turing Complete. https://en.wikipedia.org/wiki/One_instruction_set_computer Is this the case? What is the simplest Turing Complete CPU instruction set…
fadedbee
  • 42,671
  • 44
  • 178
  • 308
1
vote
1 answer

Some inference about NP

this is my first question on this site. I‌ recently, study on NP. I have some confusion about this Topic, and want to propose my inference and some one verify me. I) each NP problem can be solved in Exponential Time. II) if P=NP then…
user4672610
1
vote
2 answers

How can I simulate a turing machine?

I don't quite understand the whole idea of a turing machine thing. I am currently tasked with making a busy beaver turing machine. But the thing I don't really get is it simulates input. So what kind of input do I simulate? For example, it's asking…
gingergeek
  • 249
  • 3
  • 7
  • 12
0
votes
0 answers

What is the most basic assembler language that is turing complete?

I want to try and convert a simple language Lox (https://craftinginterpreters.com/the-lox-language.html) to basic assembly, but I don't want to use the x86 instruction set because its simply too much. Is there a basic (but Turing complete) assembler…
Kladskull
  • 10,332
  • 20
  • 69
  • 111
0
votes
0 answers

Understanding the primitives which Turing showed to be sufficient for a programming language

So it was said that Turing showed there are 6 primitives . i could think them as essentials needed to make programs. So the move left/right command makes sense because while writing code we might need to go back to rewrite or add something more.…
Paracetamol
  • 101
  • 1
0
votes
0 answers

TOC program A that when given any program B as input can determine whether or not B produces “hello world”

“It is not possible to create a computer program A that when given any program B as input can determine whether or not B produces “hello world” as its first statement”.? need proof.
Sajjad Sarwar
  • 96
  • 1
  • 8
0
votes
1 answer

Turing Machine For balanced parenthesis

How to desgin a turing machine that can recognize the strings of balanced parenthesis? For example (())().
pankaj shah
  • 21
  • 1
  • 2
0
votes
0 answers

Why does a Turing machine take n^k steps for computing an input?

I was reading about Cook's Theorem for Turing machine. In its proof, it is said that the Turing would take at most n^k steps (where k is an integer and k > 0) to compute an input of length 'n' This is probably assuming that the Turing machine does…
Sukumar Gaonkar
  • 147
  • 2
  • 12
0
votes
0 answers

Minimum theoretical stateless instruction set without composite instructions

Ever since I learned how to manipulate assembly in college, I have been fascinated with the idea of starting as small as possible and building up to infinite complexity. I've been working on my own theoretical minimal instruction set which avoids…
Timothy Eckstein
  • 307
  • 1
  • 2
  • 10
0
votes
0 answers

Turing Machines/ Turing Completeness

I was reading the ethereum white paper and I came up with the term Turing-Complete. I did some research and I found out this is a whole mathematical theory. How can I start learning about Turing-Machines and Turing Completeness on a technical level.…
nikos_k
  • 49
  • 1
  • 4
0
votes
0 answers

Is the following hypothetical instruction set Turing complete?

I have devised a hypothetical instruction set that I believe is Turing-complete. I cannot think of any computational operation that this instruction set is not able to complete. I would just like to verify that this hypothetical instruction set is…
Uncreative Name
  • 111
  • 2
0
votes
1 answer

Sub-Turing Complete Class of computational models

Many programming languages and systems are Turing-complete; they can simulate any Turing machine, and therefore can simulate any finite state machine as well. Consider the following informal model: Language A defines a finite set of NAND gates,…
T Williams
  • 45
  • 5
0
votes
0 answers

What elements does a turing complete programming language need to consist of?

I've been looking for this but came to nothing. I saw this explanation once in some of the python's book out there but i don't remember which one. So, what elements(variable, loop, branching, etc) a programming language should consist of being a…
Scarlett
  • 9
  • 6
1 2 3 4 5 6
7
8