Questions tagged [turing-completeness]
207 questions
14
votes
2 answers
How many pairs of brackets are sufficient to make Brainfuck Turing complete?
Brainfuck is a Turing complete programming language that uses only 8 symbols (6 if you ignore I/O).
The two most notable ones that push it to Turing completeness are [and ], essentially Brainfuck's label and goto.
Normally, programs in Brainfuck use…
MilkyWay90
- 251
- 1
- 10
11
votes
2 answers
Is Desmos Turing-Complete?
The graphing calculator Desmos has a ton of functions, and can express any arithmetric formula. What I want to know is, is it Turing-Complete?
Desmos supports, among other things:
Most mathematical operations / functions
Multiplication, addition,…
emanresu A
- 213
- 2
- 7
6
votes
2 answers
Does a Universal Turing Machine have more computational power than a non-universal one?
I'm a bit confused about these concepts. As far as I understand, something is Turing complete when it can simulate a Turing machine. And there is this thing called a Universal Turing machine which is universal because it can simulate a Turing…
Juan
- 755
- 4
- 16
1
vote
1 answer
Emergent complexity and Turing Completeness
Is there some link between the concept of emergence and Turing Completeness? The ideas feel intuitively like they might be linked, but I can find nothing online.
The idea came to me because I was exploring Conway's Game of Life, and it was hard not…
Ben I.
- 1,710
- 14
- 26
1
vote
0 answers
The simplest Turing-complete language
To prove that a new language is Turing-complete the authors need to show that it can simulate any other (already known) Turing-complete language.
I wonder what Turing-complete language is the simplest to simulate? Bitwise Cyclic Tag looks very easy.…
Danylo Y
- 111
- 3
1
vote
2 answers
Is there a query language variant of Turing Completeness?
By this I mean a theory where you can say Language X is Query Complete so that you know that language is able to do any sort of query? I'm guessing not because some queries would run into things that a language would have to be Turing complete to…
user254694
- 111
- 2
0
votes
2 answers
How can a 64KiB computer do the same task as a modern computer?
I took an extremely interesting intro to CE course, learning about transistors/memory/logic gates up to LC-3 assembly. Something that was really interesting to me was learning about how a processor's frequency is its speed, determined by the clock…
Michael W
0
votes
3 answers
Does a language/maschine/system need to be able to halt to be universal?
Is it possible for a language (or machine or system) to be universal or turing complete, when there is no possibility to write a program for it that halts?
Lets say we create a new language, brainfuck-nonstop, that like brainfuck with a single…
12431234123412341234123
- 109
- 1
0
votes
1 answer
Number of logic gates for "reasonable" Turing completeness
Somewhere on stackexchage, I, or someone else asked what was the proper term for Turing completeness minus the infinite memory (e.g. a Turing machine that one can actually build, no bigger than your typical data center). Answer was…
hotpaw2
- 101
- 1
-2
votes
1 answer
Is DNA computation Turing complete?
I have heard DNA being referred to as "code", this is because it is an instruction set which dictates the bodies' properties. However, DNA (as far as I have learned), has no conditional jumps or normal jumps.
After reading the article DNA computing…
