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
5
votes
3 answers

Is Move a Turing-complete language?

Will Move (on the Diem platform), like Ethereum, be turing complete? I have read the white paper but have been unable to decide. This is the white paper:…
Aminadav Glickshtein
  • 23,232
  • 12
  • 77
  • 117
5
votes
2 answers

How does this implementation of turing-complete Rule 110 in HTML5+CSS3 work?

This morning, I came across the following implementation of Rule 110 in pure HTML5 + CSS3 (no javascript). You press tab and space in sequence to run the automaton. http://elilies.com/rule110-full.html I looked at the source code, but I really can't…
silverasm
  • 501
  • 5
  • 10
5
votes
5 answers

Is Stata Turing-complete?

I have been doing some statistics work with Stata recently and not enjoying it very much. It doesn't feel to me like it's a "proper" programming language: in particular I don't think there's a way to loop until a condition is met. Am I right in my…
Tom Smith
  • 1,659
  • 1
  • 15
  • 20
5
votes
5 answers

What makes people think that NNs have more computational power than existing models?

I've read in Wikipedia that neural-network functions defined on a field of arbitrary real/rational numbers (along with algorithmic schemas, and the speculative `transrecursive' models) have more computational power than the computers we use today.…
Bubba88
  • 1,910
  • 20
  • 44
5
votes
3 answers

How could a quine in my programming language look?

I have created a turing-complete programming language (already proven) so it must be possible to write a quine for it, right? But all quines I know store their source code in a string and then replace a special character in it using something like…
ads
  • 53
  • 2
5
votes
2 answers

Can a language be Turing-complete without any support for arrays?

If a language has control structures and variables, but no support for arrays, lists, memory access and allocation, etc, can it be Turing-complete? Maybe if there was no limit to the amount of variables you can create, you can simulate arrays by…
unknown
5
votes
5 answers

What can awk do that sed can't?

I used sed for a batch ptovess where I could not do it with awk. Vould awk have done it? Or is it more a matter of choice and call awk and sed equivalent for the usage. They both do the common search replace similar with i/o. Is there a good example…
Niklas Rosencrantz
  • 25,640
  • 75
  • 229
  • 424
5
votes
2 answers

Turing Complete Alphanumeric x86 Instruction Set (Subset)

I am looking to create a minimal, computationally universal subset of alphanumeric x86 opcodes. Eventually I want the subset to contain as few instructions as possible, and if there are multiple minimal subsets I want to know that as well. The…
cytinus
  • 5,467
  • 8
  • 36
  • 47
4
votes
3 answers

Consequences of inability to add natural numbers in C

In System F I can define the genuine total addition function using Church numerals. In Haskell I cannot define that function because of the bottom value. For example, in haskell if x + y = x, then I cannot say that y is zero - if x is bottom, x + y…
nponeccop
  • 13,527
  • 1
  • 44
  • 106
4
votes
3 answers

Is pure Prolog Turing-complete, and if so, why can't it implement list intersection?

The Wikipedia section on this topic is a mess. It states: Pure Prolog is based on a subset of first-order predicate logic, Horn clauses, which is Turing-complete. Turing completeness of Prolog can be shown by using it to simulate a Turing…
MWB
  • 11,740
  • 6
  • 46
  • 91
4
votes
1 answer

Is the Starbucks menu Turing Complete?

If we were to interpret the Starbuck's mini-language menu system as some sort of grammar or state machine, would that grammar be Turing complete? A description of the Starbuck's order mini-language can be found here
NathanChalmers
  • 59
  • 4
4
votes
1 answer

Can a Turing complete language ever have a CFG?

Does turing completeness preclude a language from having a CFG? I couldn't find any paper saying that. I found this: "TeX can only be parsed by a complete Turing machine (modulo the finite space available), which precludes it from having a BNF."
Bighted19
  • 119
  • 7
4
votes
1 answer

Brainfuck with 1bit memory cells?

Would an implementation of the programming language Brainfuck, still be turing complete if its memory cells were 1bit in capacity, instead of the usual 8bit? The + and - instructions become identical, however this need not be a problem. I see no…
alan2here
  • 3,223
  • 6
  • 37
  • 62
4
votes
2 answers

Is natural language Turing complete?

I'm pretty sure a human language (e.g. English) is powerful enough to simulate a Turing machine, which would make it Turing complete. However, that would imply natural languages are no more or less expressive than programming languages, which seems…
plátano plomo
  • 1,672
  • 1
  • 18
  • 26
4
votes
5 answers

SELECT no rows and no columns?

Is it possible to write a SELECT statement, which returns dataset with zero rows and zero columns?
Dims
  • 47,675
  • 117
  • 331
  • 600
1 2 3
4
5 6 7 8