Questions tagged [turing-completeness]
The turing-completeness tag has no usage guidance.
204
questions
0
votes
3
answers
43
views
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-...
1
vote
4
answers
3k
views
Can we ever achieve Turing completeness?
I want to relate Turing completeness to the Halting Problem.
As far as I know we say something is turing complete (eg: a programming language) when it can compute any function and can do any task. But ...
2
votes
3
answers
287
views
Does the first incompleteness theorem imply that any Turing complete programming language must have undefined behavior?
If I understand correctly, the first incompleteness theorem says that any "effectively axiomatized" formal system which is consistent must contain theorems which are independent of the ...
2
votes
2
answers
125
views
What are quines (layman friendly)?
I was going through the Wikipedia page on Quines and did not understand this paragraph -
A quine is a fixed point of an execution environment, when the execution environment is viewed as a function ...
- 123
3
votes
1
answer
2k
views
Is a machine Turing-complete when it can decide a context-sensitive language?
If a machine can decide a context-sensitive language (like the language of palindromes with a non-linear center) is that fact a proof that the machine is Turing-complete?
Can this be used to prove ...
- 155
17
votes
3
answers
4k
views
Does the Turing test have anything to do with Turing completeness or Turing machines?
I am studying Turing machines and Turing completeness and just remembered I saw something called the Turing test. It seems that the Turing test (from Wikipedia)
is a test of a machine's ability to ...
- 325
1
vote
1
answer
34
views
Concrete example of a set with a lower degree of unsolvability
Post's problem, posed in 1944 by Post, was to know if there is a recursively enumerable set, which, being undecidable, was not equivalent to the Halting problem under Turing reducibility. While I've ...
- 413
0
votes
0
answers
52
views
Why, in principle, can a Turing machine describe any computation or procedure?
Why is it that a Turing machine can perform all kinds of calculations and procedures?
As a test, I tried to perform a four-quadratic calculation using a Turing machine myself.
However, although I ...
- 1
-2
votes
1
answer
252
views
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 ...
0
votes
0
answers
66
views
If a Turing machine can compute any computable problem how can Turing completeness be achived?
To my knowledge a Turing machine is able to compute anything considered computable.
I got the definition of Turing completeness from this answer Explain the difference between Turing Complete and ...
0
votes
0
answers
44
views
Is Brainf*ck still Turing Complete without I/O?
I've made an interetsing esolang, and to prove Turing completeness, I've written a small Brainf*ck interpreter in it. However, due to the nature of the language, input is rather hard to handle.
The ...
1
vote
1
answer
87
views
Why is the Church-Turing thesis not accepted as fact?
I recognize that it has overwhelming consensus at this point, but from what I understand, it's still technically considered "probably true" instead of "definitely true".
If we go ...
- 284
0
votes
2
answers
79
views
Why is Rule 110 considered "weakly" universal?
My supposition is that this is was more or less an automatic designation based on the fact that Rule 110 requires an infinite "background tiling" of the 14-bit sequence ...
- 284
1
vote
1
answer
54
views
Instances of simulating lambda calculus?
There are a ton of resources on the web devoted to proving some esoteric language is Turing complete by simulating arbitrary turing machines. I have an esoteric language I want to prove is complete, ...
- 225
1
vote
0
answers
132
views
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 ...
- 111
1
vote
0
answers
120
views
Simple proof that Lisp expresses all computable list functions
Given computable function $f : LispTerm \rightarrow LispTerm$ is it possible to implement it in Lisp?
The $LispTerm$ is any term that is constructed using cons, <...
- 93
0
votes
3
answers
137
views
Is Turing completeness necessary?
Most programming languages are Turing complete (finite memory blah blah blah), and when we design languages this is a goal.
But is it really necessary? What algorithms do we typically use that require ...
- 91
0
votes
1
answer
222
views
How does nondeterminism affect the power of a machine?
For example, in finite-state machines (FSM), the main difference between a deterministic (DFA) and a non-deterministic machine (NFA) is that there are possibly more branches or outputs for each input, ...
2
votes
1
answer
150
views
What exactly does Turing Equivalence mean?
Assume I have a programming language $L$ with well-defined semantics.
Showing Turing-completeness is straightforward: if I write a program using $L$ simulating the universal TM, I'm done.
What I'm ...
- 315
1
vote
0
answers
26
views
What are practical applications for markovs algorithm(string rewriting systems)
:)
Currently I am browsing through the internet on the hunt for a topic for my bachelors thesis. Whilst being on Reddit I discovered an interesting repo (https://github.com/mxgmn/MarkovJunior) for a ...
- 11
0
votes
0
answers
112
views
What is the most computationally efficient Turing complete system?
I'm making a program that involves making models of and working with arbitrary systems (or programs). What is the most computationally efficient Turing complete system to model these in?
By "...
0
votes
1
answer
79
views
What does it mean for a machine language to be Turing-complete?
I was reading the Wikipedia article on Turing completeness, but I was having a hard time putting together all of the concepts. In simple terms, what does it mean for an instruction set to have Turing-...
6
votes
2
answers
377
views
Do all Turing-complete programming languages have to contain infinite loops?
Intuitively, it seems that if a programming language is Turing-complete, then it must contain a program that's an infinite loop. I have formalized this below:
Conjecture. There does not exist a set $...
2
votes
1
answer
127
views
is HaltingFuck computable?
A while ago I defined the language HaltingFuck, but I've never been able to figure out its computational class. The language is defined as follows:
HaltingFuck is a language very much like Brainfuck, ...
- 375
1
vote
1
answer
63
views
Encoding Turing machine-like behavior using families of sequences of vector spaces and modules. P=NP related
Let $F$ be a field. Suppose we have a machine $T$ that works with words that are elements of $F$, for exmaple $F = \Bbb{Z}/2, \Bbb{Q}$ (using arbitrary precision arithmetic), or $\Bbb{Z}/p$ for a ...
- 495
2
votes
0
answers
78
views
Limited number of calling for a decision blackbox to compute all the solutions
I am trying to reduce between a solution problem and a decision version of the same problem.
The problem is the orthogonality problem. Given $2$ sets $L$ and $R$, whose size each is $n$ vectors over $\...
- 494
4
votes
1
answer
564
views
How could you encode such a function in lambda calculus?
I just read the definition of lambda calculus. Apparently it's Turing complete, but I tried writing a very simple function and I couldn't:
...
- 43
1
vote
1
answer
95
views
In a rigorous mathematical sense, what is the significance of Turing-completeness?
I know that Turing-completeness is the ability to simulate a Turing machine, and from what I've read, the reason why we should care about Turing-completeness is that it demonstrates that a machine can ...
- 11
1
vote
1
answer
118
views
kolmogorov complexity for finite Language?
In lectures my professor proved that there is no Turing machine that for every x it calculates k(x).
On the other hand, I saw a claim online that for finite language L there is a Turing machine that ...
- 61
0
votes
0
answers
46
views
Finite Number of Turing Machines that stop after k steps?
For this question suppose Alphabet for input is {0,1}.
Given:
L={<M> | M stops on every input after maximum 1000 steps}
My professor claimed that there is a ...
- 61
0
votes
0
answers
69
views
Is the set of all halting programs for all universal Turing machines recursively enumerable?
I understand that one can use dovetailing to recursively enumerate the domain of a UTM.
However, I am trying to recursively enumerate the domain of all possible UTM.
My starting point was to use a ...
- 345
5
votes
3
answers
3k
views
How Turing Machine Can Never Stop?
My professor discussed the following Turing machine M' on input (,x):
Generate number n
Run M on X, for n steps
If M stops, accept
I don't understand No.3
If we are running M on input X for final ...
- 61
1
vote
3
answers
452
views
Are all Turing machines Turing complete?
I have recently been reading up on TOC, and had this thought, which does not seem to be answered explicitly anywhere.
They way I have understood it, a system is Turing complete if it can simulate any ...
- 11
12
votes
8
answers
3k
views
Can any known sub-Turing-complete model of computation enumerate precisely the set of prime numbers?
I wish there were more, but the subject pretty much captures my whole question.
Is there a non-Turing-complete model (some constrained term rewriting system or automaton or what have you) which is ...
- 284
-1
votes
2
answers
55
views
Are there infinitely many distinct implementations of any algorithm using any Turing-complete computational model?
Subject pretty much says it all. My strong impression is that for any algorithm and any choice of programming language or computational model, if it's Turing-complete, then there must be infinitely ...
- 284
11
votes
2
answers
3k
views
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 ...
- 213
1
vote
1
answer
199
views
Had Conway's Game of Life or any C-A been demonstrated to generate non-repeating pattern?
As we know, Conway's Game of Life is Turing-complete. And Turing-complete systems can be used to calculate irrational numbers such as $\sqrt{2}$, $\pi$, $e$, etc. which have non-repeating digits.
So ...
- 192
4
votes
0
answers
96
views
Necessity of encoding for certain models of computation
Consider the following model of computation (from here).
Although Fractran is Turing-complete, it assumes that the "user" is able to perform the steps of encoding the input ($2^{n + 1}$) ...
- 91
-1
votes
1
answer
108
views
how can turing machines be universal models of computation if they can't perform binary search?
I have searched around and it seems like it is impossible for a Turing machine to implement binary search for an arbitrary sized array. How can a turing machine be called universally computable if it ...
- 23
2
votes
2
answers
150
views
How do we define the term "computation" across models of computation?
How do we define the term computation / computable function generically across models of computation?
Beginning with the textbook definitions of: {Linz, Sipser and Kozen} for "computable function&...
- 87
0
votes
1
answer
985
views
EQ_{TM} is not Turing recognizable, but we can reduce A_{TM} to it?
So as I understand $EQ_{TM}$ (problem of deceiding whether two turing machines are equivalent) is not Turing Recognizable (by showing that $A_{TM}$ is reducible to its complement ${NEQ_{TM}}$). But we ...
- 219
5
votes
1
answer
914
views
Explain the difference between Turing Complete and Turing Equivalence
I'm not sure if I understand the difference between Turing Complete and Turing Equivalent programming languages.
A computational system that can compute every Turing-computable
function is called ...
- 463
2
votes
0
answers
263
views
Is the While programming language with bounded number of variables Turing complete?
In our lecture it was proven that WHILE-Programs are turing-complete. In short a WHILE-Program only allows the following:
...
- 21
2
votes
1
answer
75
views
Computation equivalence of functional and procedural programming
I'm really interested in the idea of functional programming, it seems like a very modular way of doings things. I've seen some suggestion that functional programming is just as powerful as procedural ...
- 23
19
votes
2
answers
6k
views
Paradox? Pure Prolog is Turing-complete and yet incapable of expressing list intersection?
Pure Prolog (Prolog limited to Horn clauses only) is Turing-complete. In fact, a single Horn clause is enough for Turing-completeness.
However, pure Prolog is incapable of expressing list intersection....
- 485
1
vote
1
answer
257
views
What is the theoretical minimum number of "switches" requried to implement a Turing-complete CPU?
Where "switches" are the basic abstract building blocks for logic gates: vacuum tubes, transistors, magnetic relays, or whatever. We're not counting any switches in the RAM or tape drive ...
- 111
9
votes
3
answers
918
views
Can a total programming language be Turing-complete?
I've seen two answers to this:
Wikipedia says no:
These restrictions mean that total functional programming is not Turing-complete.
And the Wikipedia article cites D.A. Turner as the coiner of "...
- 346
0
votes
1
answer
62
views
Is there a #$P$-complete counting problem such that every (valid) instance of its decision version is a Yes-instance?
I want to know whether there is a decision problem, written EasyProblem, satisfying the follow property:
For every valid instance $x$, $x$ is a Yes-instance for EasyProblem (if we construct ...
- 623
-1
votes
1
answer
72
views
What is the computational class of a pushdown automaton with real values?
Say there is a push-down automaton, in this example I'll use a Deadfish-like set:
+: increase x by 1
0: set x to 0
...
0
votes
1
answer
324
views
Universal Turing Machine algorithm
First, I learned this based on these facts:
Turing machine (TM) will be define with 7-tuple Notation, $M=\langle Q,G,b,S,d,q_0,F\rangle$.
Any computation rules that can use to simulate any possible ...
