Search Results

Search found 113 results on 5 pages for 'turing'.

Page 2/5 | < Previous Page | 1 2 3 4 5  | Next Page >

• Is it possible to create a quine in every turing-complete language?

  - by sub

  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, variables,…

  Read the article

• GDL Presents: Van Gogh Meets Alan Turing

  GDL Presents: Van Gogh Meets Alan Turing How can art and daily life be joined together? Host Ido Green chats with creators Uri Shaked & Tom Teman about tackling this question with their "Music Room" -- a case study in the power of Android -- and with Emmanuel Witzthum on his project "Dissolving Realities," which aims to connect the virtual…

  Read the article

• Does Turing-complete implies possibility of malware? [closed]

  - by Mathematician82

  Is it possible to build an operating system that contains some Turing complete compiler (language?) but is unable to run any malware? Or is there any definition for a malware? This question popped on my mind as I was wondering why Windows has more malware than Linux. If Linux contains a C programming language and its compiler, I think it is…

  Read the article

• why there can't be a program that checks another program

  - by Night Walker

  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.

  Read the article

• Would relational calculus be Turing-complete if it allowed unsafe queries?

  - by Jason Baker

  My understanding about Codd's concept of "safe queries" was created to ensure that a query would always terminate. One of the key ability of a Turing machine is that it can work on infinite calculations (and thus isn't guaranteed to terminate). If the safe query restriction were removed, would relational calculus be Turing-complete since…

  Read the article

• what practical proofs are there about the Turing completeness of neural nets? what nns can execute c

  - by Albert

  I'm interested in the computational power of neural nets. It is generally accepted that recurrent neural nets are Turing complete. Now I was searching for some papers which proofs this. What I found so far: Turing computability with neural nets, Hava T. Siegelmann and Eduardo D. Sontag, 1991 I think this is only interesting from a…

  Read the article

• Can these sorts of programs exist in every Turing-complete language?

  - by I can't tell you my name.

  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…

  Read the article

• I've heard that LaTeX is Turing complete. Are there any programs written in LaTeX?

  - by ire_and_curses

  It's possible to do interesting things with what would ordinarily be thought of as typesetting languages. For example, you can construct the Mandelbrot set using postscript. It is suggested in this MathOverflow question that LaTeX may be Turing-complete. This implies the ability to write arbitrary programs (although it may not be…

  Read the article

• Why call-by-value evaluation strategy is not Turing complete?

  - by Roman

  I'm reading an article about different evaluation strategies (I linked article in wiki, but I'm reading another one not in English). And it says that unlike to call-by-name and call-by-need strategies, call-by-value strategy is not Turing complete. Can anybody explain, please, why is it so? If it's possible, add an example pls.

  Read the article

• Commémoration du centenaire d'Alan Turing, "il était l'un des premiers à établir ce qu'était un ordinateur" pour le directeur de Microsoft Research

  Commémoration du centenaire d'Alan Turing « il était l'un des premiers à établir ce qu'était un ordinateur » pour le directeur de Microsoft Research Ce samedi 23 juin 2012 marquera le centième anniversaire d'Alan Turing, un pionnier de l'informatique moderne. Considéré comme « le père de l'ordinateur », Alan Turing est un…

  Read the article

• Un ordinateur réussit pour la première fois le test de Turing en se faisant passer pour un garçon de 13 ans

  Un ordinateur réussit pour la première fois le test de Turing en se faisant passer pour un garçon de 13 ansUn ordinateur grâce à un programme informatique a réussi pour la première fois à convaincre des chercheurs qu'il était un enfant de 13 ans, devenant ainsi la première machine à passer le test Turing.L'exploit réalisé…

  Read the article

• Can a programming language without arrays be turing-complete?

  - by Ring

  My question is simple: There are no arrays possible. That means you can address variables only "statically" by directly using their unique name. (This already throws out the default array syntax variable[ index ] and variable variables) "Emulated arrays" are counted as arrays and excluded too. Examples: You could…

  Read the article

• How to create a Turing machine that takes a single digit decimal number from 0 - 9 and output the cu

  - by Julian

  I'm working on a project for a Turning machine but having problems conceptualizing the steps. f(x) = x^3, where x is a single digit between 0 - 9 inclusive. Based on my understanding I am to convert the number to binary but how do I find the cube of a number in binary. Also, how do I write the cube on the…

  Read the article

• Is there a better approach to speech synthesis than text-to-speech for more natural output? [closed]

  - by Anne Nonimus

  We've all heard the output of text-to-speech systems, and for anything but very short phrases, it sounds very machine-like. The ultimate goal of speech synthesis systems is to pass a Turing test of hearing. Clearly, the state of the art in text-to-speech has much to improve. However, speech synthesis isn't…

  Read the article

• How could a quine in my programming language look?

  - by ads

  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…

  Read the article

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

  - by Bubba88

  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…

  Read the article

• Which programming language requires the most different mindset from C++?

  - by carleeto

  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…

  Read the article

• Really minimum lisp

  - by Mgccl

  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…

  Read the article

• The Immerman-Szelepcsenyi Theorem

  - by Daniel Lorch

  In the Immerman-Szelepcsenyi Theorem, two algorithms are specified that use non-determinisim. There is a rather lengthy algorithm using "inductive counting", which determines the number of reachable configurations for a given non-deterministic turing machine. The algorithm looks like this: …

  Read the article

• What's what awk can't that sed can?

  - by LarsOn

  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.

  Read the article

• Creating a computer with pencil and paper [closed]

  - by Justian Meyer

  This concept has been brought to my attention before, but many people might know it from this popular comic here, where he uses stones instead of points on a paper. This concept is so abstract to me. A full-functioning computer that can manage algorithms, input, output, etc. without…

  Read the article

• Turing's Craft exercise stumped me... seems too easy.

  - by Chris

  "Write a for loop that prints the integers 1 through 40, separated by spaces or new lines. You may use only one variable, count which has already been declared as an integer." So I use... for(count = 1; count <= 40; count++) { cout << " " << count; } but they…

  Read the article

• A Guided Tour of Complexity

  - by JoshReuben

  I just re-read Complexity – A Guided Tour by Melanie Mitchell , protégé of Douglas Hofstadter ( author of “Gödel, Escher, Bach”) http://www.amazon.com/Complexity-Guided-Tour-Melanie-Mitchell/dp/0199798109/ref=sr_1_1?ie=UTF8&qid=1339744329&sr=8-1 here are some notes and…

  Read the article

• What kinds of demos are good to make for a software engineer job

  - by user23012

  I have created my cv site and sent out my demos for a while now, but most of my demos are either from my course or games related since my course was a games programming course, I was wondering what kind of demos are good to show off my skills in programming in general. These are…

  Read the article

• Objective-measures of the expressiveness of programming languages [closed]

  - by Casebash

  I am very interested in the expressiveness of different languages. Everyone who has programmed in multiple languages knows that sometimes a language allows you to express concepts which you can't express in other languages. You can have all kinds of subjective discussion about…

  Read the article

< Previous Page | 1 2 3 4 5  | Next Page >