What is Turing Complete?
What does the expression Turing Complete means? Can you give a simple explanation, without going into too much theoretical details? ...
turing-complete
Are LINQ expression trees Turing complete?
As they are in .Net 3.5. I know they are in 4.0, as that's what the DLR works with, but I'm interested in the version we have now. ...
Practical non-Turing-complete languages?
Nearly all programming languages used are Turing Complete, and while this affords the language to represent any computable algorithm, it also comes with its own set of problems. Seeing as all the algorithms I write are intended to halt, I would like to be able to represent them in a language that guarantees they will halt. Regular expre...
Which programming language requires the most different mindset from C++?
I'm looking for a useful language that is turing complete. Being predominantly a C++ programmer, I'd like a language that forces me to learn from scratch to wrap my head around it. What I hope to get out of this are new ways of approaching a programming problem and thinking it through - ways that I would not have necessarily used if I wa...
Why can Conway’s Game of Life be classified as a universal machine?
I was recently reading about artificial life and came across the statement, "Conway’s Game of Life demonstrates enough complexity to be classified as a universal machine." I only had a rough understanding of what a universal machine is, and Wikipedia only brought me as close to understanding as Wikipedia ever does. I wonder if anyone cou...
What are practical guidelines for evaluating a language's "Turing Completeness"?
I've read "what-is-turing-complete" and the wikipedia page, but I'm less interested in a formal proof than in the practical implications of being Turing Complete. What I'm actually trying to decide is if the toy language I've just designed could be used as a general-purpose language. I know I can prove it is if I can write a Turing mac...
Can the halting problem be solved for any non-turing languages?
The halting problem cannot be solved for turing complete languages and it can be solved trivially for some non TC languages like regexes where it always halts. I was wondering if there are any languages where it has both the ability to halt and not halt and there is also an algorithm that can determine whether it halts. ...
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 values. I don't think we could find it in The Book. ...
Can a language be turing complete but incomplete in other ways?
For example, are there certain things when writing an operating system that cannot be accomplished in a turing complete language? ...
Code Golf: Shortest Turing-complete interpreter.
I've just tried to create the smallest possible language interpreter. Would you like to join and try? Rules of the game: You should specify a programming language you're interpreting. If it's a language you invented, it should come with a list of commands in the comments. Your code should start with example program and data assigned t...
What's what awk can't that sed can?
Or just a matter of choice and call awk and sed equivalent towards usage. They both do the common search replace seemingly identically regarding i/o. ...
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 creating variables like array_1, array_2, ... array_6000 and manually loop through them, and...
How can I simulate a turing machine?
I don't quite understand the whole idea of a turing machine thing. I am currently tasked with making a busy beaver turing machine. But the thing I don't really get is it simulates input. So what kind of input do I simulate? For example, it's asking me how many 1s the 3 states busy beaver machines writes on tape? I'm sure I need to write...
Is CSS turing complete?
CSS isn't, insofar as I know, Turing complete. But my knowledge of CSS is very limited. Is CSS Turing complete? Are any of the existing draft or committees considering language features that might enable Turing completeness if it isn't right now? ...
Is it possible to create a quine in every turing-complete language?
I just wanted to know if it is 100% possible, if my language is turing-complete, to write a program in it that prints itself out (of course not using a file reading function) So if the language just has the really necessary things in order to make it turing complete (I would prove that by translating Brainf*ck code to it), like output, ...
Can these sorts of programs exist in every Turing-complete language?
In every Turing-Complete language, is it possible to create a working Compiler for itself which first runs on an interpreter written in some other language and then compiles it's own source code? (Bootstrapping) Standards-Compilant C++ compiler which outputs binaries for, e.g.: Windows? Regex Parser and Evaluater? World of Warcraft clo...
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 chr and ord. My language only has the following Basic arithmetics Int and string types ...
Really minimum lisp
What is the minimum set of primitives required such that a language is Turing complete and a lisp variant? Seems like car, cdr and some flow control and something for REPL is enough. It be nice if there is such list. Assume there are only 3 types of data, integers, symbols and lists.(like in picolisp) ...
why there can't be a program that checks another program
Hello all I am trying to find the logical alan turing explanation why there can't be a program that checks another programs. I remember we learned in on the computation course but now i just can't find the solution , and i need to explain it to some one at my work . Thanks for help. ...
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. Of course it was a page of russian wikipedia (ru.wikipedia.org) and that may be not properl...