Questions tagged [turing-completeness]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
1 vote
1 answer
65 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 ...
user avatar
  • 205
1 vote
0 answers
22 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 ...
user avatar
0 votes
0 answers
68 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 "...
user avatar
0 votes
1 answer
34 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-...
user avatar
4 votes
2 answers
112 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 $...
user avatar
2 votes
1 answer
117 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, ...
user avatar
  • 375
1 vote
1 answer
22 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 ...
user avatar
2 votes
0 answers
73 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 $\...
user avatar
4 votes
1 answer
535 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: ...
user avatar
  • 43
0 votes
1 answer
52 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 ...
user avatar
0 votes
1 answer
53 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 ...
user avatar
  • 51
0 votes
0 answers
44 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 ...
user avatar
  • 51
0 votes
0 answers
31 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 ...
user avatar
  • 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 ...
user avatar
  • 51
0 votes
0 answers
62 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 ...
user avatar
  • 1
12 votes
8 answers
2k 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 ...
user avatar
  • 254
-1 votes
2 answers
50 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 ...
user avatar
  • 254
9 votes
2 answers
1k 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 ...
user avatar
1 vote
1 answer
144 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 ...
user avatar
  • 151
4 votes
0 answers
94 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}$) ...
user avatar
-1 votes
1 answer
88 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 ...
user avatar
  • 23
2 votes
2 answers
105 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&...
user avatar
  • 123
0 votes
1 answer
236 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 ...
user avatar
5 votes
1 answer
388 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 ...
user avatar
  • 453
2 votes
0 answers
223 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: ...
user avatar
2 votes
1 answer
71 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 ...
user avatar
18 votes
2 answers
5k 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....
user avatar
  • 455
1 vote
1 answer
116 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 ...
user avatar
  • 111
6 votes
2 answers
624 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 "...
user avatar
0 votes
1 answer
56 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 ...
user avatar
  • 587
0 votes
1 answer
52 views

What is the computational class of a pushdown automaton with real values?

Say there is a push-down automata, in this example I'll use a deadfish-like set: +: increase x by 1 0: set x to 0 ...
user avatar
0 votes
1 answer
173 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 ...
user avatar
1 vote
2 answers
192 views

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 ...
user avatar
3 votes
2 answers
116 views

Intuition for Church-Turing thesis for Turing machines

I can very clearly see "why" mu-recursion is a universal model of computation, i.e. why the Church-Turing thesis -- that any physically computable algorithm can be executed with mu-recursion ...
user avatar
0 votes
3 answers
966 views

Is English Turing-complete?

Is English Turing-complete? Intuitively it makes sense that English is Turing complete, since you can talk someone through building a Turing machine. But I also think there might be some operators ...
user avatar
0 votes
1 answer
69 views

Why is the Halting problem decidable for Goto languages limited on the highest value of constants and variables?

This is taken from an old exam of my university that I am using to prepare myself for the coming exam: Given is a language $\text{Goto}_{17}^c \subseteq \text{Goto}$. This language contains exactly ...
user avatar
0 votes
1 answer
97 views

Turing-completeness of Goto language with limited constants

This is taken from an old exam of my university that I am using to prepare myself for the coming exam: Given is a language $\text{Goto}_{17} \subseteq \text{Goto}$. This language includes exactly ...
user avatar
-1 votes
1 answer
23 views

Determine if the following problem is decidable or not : Does the read–write head of a TM with the input w leave the word w?

Determine if the following problem is decidable or not : Does the read–write head of a TM with the given input w leave the word w on the tape?
user avatar
  • 147
-1 votes
1 answer
16 views

Is the Languague which contains all TMs which write the blank symbol at firs by the given input w decidable?

Consider the problem of determining whether a Turing machine M on an input w writes the blank symbol at first. Is this decidable ?
user avatar
  • 147
2 votes
1 answer
103 views

Confusion in Turings proof of the undecidability of the Entscheidungsproblem

I was reading Turing's paper on computable numbers and the Entscheidungsproblem. There is this part of Section 9, Part II that I cannot quite seem to understand. He says: It is pretty straight ...
user avatar
  • 125
0 votes
2 answers
27 views

Equivalence between a TM and a changing TM

Let a changing TM be a TM which is not able to write the same symbol which is being read. Formal: $M^*=(Q,\Sigma,\Gamma,\delta,q_{accept},q_{reject})$,$\delta(q,a)=(q^*,a^*,c),a \neq a^*$ with $q,q^...
user avatar
  • 147
2 votes
1 answer
126 views

Lambda calculus without free variables is as strong as lambda calculus?

First question: How would one prove that by removing free (unbound) variables from lambda calculus, and allowing only bound variables, its power is not reduced (it is still Turing-complete) ? Second ...
user avatar
1 vote
1 answer
110 views

Turing machine that can move right only $O(1)$ steps beyond input

I need to prove that a Turing machine that can move only $k$ steps on the tape after the last latter of the input word is not equal to a normal Turning machine. My idea is that given a finite input ...
user avatar
  • 165
1 vote
0 answers
94 views

If a turing machine can't solve the halting problem for a machine X, does this imply that X is at least as powerful as a turing machine?

Say I have a deterministic machine X, and I prove that a turing machine can't solve the halting problem for this machine when given a certain input. Does this imply that this machine X is turing-...
user avatar
1 vote
0 answers
43 views

Turing-completeness of affine programs

Are unguarded affine programs Turing-Complete? Are affine programs with affine guards Turing-Complete? Unguarded program: all branches are taken Affine program: only assignments like $x:=x_1+5x_2-...
user avatar
1 vote
0 answers
22 views

Is there a recursive problem encoding the Turing completeness of a model of computation?

Suppose we have a model of computation $C$ we want to show to be Turing complete. The usual strategy would be to emulate within $C$ any model of computation we already know to be Turing complete (e.g. ...
user avatar
  • 111
2 votes
4 answers
670 views

To what extent is an x86 machine equivalent to a Turing Machine?

To what extent is the abstract model of computation specified by the x86 language Turing complete? The above question is related to this question: Is C actually Turing-complete? In theoretical ...
user avatar
  • 123
0 votes
1 answer
96 views

How can Turing complete machines exist theoretically if the halting problem is undecidable

As the question says, if I input on the tape of a Turing complete machine a program that solves the halting problem with the correct inputs the program will never end its execution regardless of ...
user avatar
5 votes
1 answer
338 views

How to write a coterminating, effectful program?

[Using Idris for code examples and terminology, but the question is not about Idris per se] In a post titled A Neighborhood of Infinity, @sigfpe argues that "the kind of open-ended loop we see in ...
user avatar
  • 253
5 votes
2 answers
553 views

What can't you do without Turing-completeness?

I suppose that, since a Turing-complete language can simulate a Turing-machine, a non-Turing-complete language can't, but most programs do not have the simulation of a Turing machine as their purpose. ...
user avatar
  • 151