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
2
votes
1 answer

How to work with this turing machine?

This is a screenshot of the applet LogiCell 1.0, link to which I found here. As the bottom left corner shows, this is doing sum 0+1 and the result is 01b (bottom right hand side). I am not able to link what is displayed to what the inputs ans…
Lazer
  • 90,700
  • 113
  • 281
  • 364
2
votes
1 answer

Logic programming - Is subset with only one function symbol Turing - complete?

If I have a subset of logic programming which contains only one function symbol, am I able to do everything? I think that I cannot but I am not sure at all. A programming language can do anything user wants if it is a Turing-complete language. I…
Nanc
  • 464
  • 5
  • 15
2
votes
1 answer

Is C++ a recursively enumerable language?

I know that C++ is not decidable. But is it recursively enumerable? Let's define the set of valid C++ programs to be any well defined program under the current C++ standards. Is it possible to construct a compiler that can always identify valid C++…
user2005303
1
vote
2 answers

Terminology for a "complete" programming language?

The full definition of "Turing Completeness" requires infinite memory. Is there a better term than Turing Complete for a programming language and implementation that seems useably complete, except for being limited by finite (say 100 word or…
hotpaw2
  • 70,107
  • 14
  • 90
  • 153
1
vote
1 answer

Smallest compiler ever

Yesterday, I stuck in the internet with this article about programming language called BrainFuck. http://www.muppetlabs.com/~breadbox/bf/ So what is wonder me is this Brainfuck is the ungodly creation of Urban Müller, whose goal was apparently to…
Chuck Norris
  • 15,207
  • 15
  • 92
  • 123
1
vote
1 answer

Generally, is it possible to write kinect-like app using only C++?

I mean, write web-cam recognition that is close to kinect in it's accuracy.
nicks
  • 2,161
  • 8
  • 49
  • 101
1
vote
0 answers

How would a Turing machine implement memory protection, interrupts, or real timer that a modern CPU has?

I understand that most of the modern CPU's are Turing complete (if given an infinite memory and time). From the below, I am going to assume that the amount of memory is infinite or as much sufficient and the time is given enough when I say Turing…
user13397022
  • 107
  • 1
  • 5
1
vote
2 answers

Is this language generic/mighty enough to be used for a generic game AI?

I want to develop a genetic program that can solve generic problems like surviving in a computer game. Since this is for fun/education I do not want to use existing libraries. I came up with the following idea: The input is an array of N…
codymanix
  • 28,510
  • 21
  • 92
  • 151
1
vote
3 answers

Is it possible to write a self-interpreting FSM or Pushdown Automaton?

I'm sorry for this newbie question, but I need a quick answer to tell a friend if that's possible.
Bubba88
  • 1,910
  • 20
  • 44
1
vote
0 answers

Build AST with recursive CTE in Postgres

Given following table: create table tree ( id int, parent_id int REFERENCES tree(id), operator varchar, primary key(id) ); insert into tree values (1, null, 'AND'), (2, 1, 'NOT'), (3, 1, 'OR'), (4, 2, 'AND'), (5, 3, 'Y'), (6, 3,…
Sasa
  • 1,597
  • 4
  • 16
  • 33
1
vote
2 answers

What elegant and Turing-complete machines* you know? Is there a one from The Book?

Lambda calculus of course is quite elegant, but doesn't it bother you that there is this asymmetry between input and output of a function? I.e. you can make the function take two parameters (by returning a function) but you can't make it return two…
Łukasz Lew
  • 48,526
  • 41
  • 139
  • 208
1
vote
2 answers

Simple vs. Nested

Are simple loops as powerful as nested loops in terms of Turing completeness?
banx
  • 4,376
  • 4
  • 30
  • 34
1
vote
1 answer

Is it possible to determine if the memory array is accessed out of bounds in a Brainfuck program?

I have written by own BF Interpreter in Assembly, and now I'm writing a BF Compiler in Java that compiles to Assembly code. I wanted to implement a little nice feature that detected if the array of memory cells was out of bounds. A traditional…
skiwi
  • 66,971
  • 31
  • 131
  • 216
1
vote
3 answers

A naive questioin about UML and Turing completeness

It'a a well-known fact that UML does not Turing complete (in contrast to usual programming languages). But it seems to me UML is even more flexible than traditional languages. I can't imagine a problem you can describe by means of such language as…
El Dorado
  • 13
  • 2
1
vote
1 answer

Unrestricted Grammar: { sss | s exists in {a,b}* }

What would be a way to construct an unrestricted grammar for sss? I know that in order to construct ss, you need to construct ss^r and then re-reverse the second string, but how would that be done for sss?
riv94
  • 111
  • 12
1 2 3 4 5
6
7 8