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 tape. So far I'm thinking ...
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. ...
First some background (based on my understanding).. The Von-Neumann architecture describes the stored-program computer where instructions and data are stored in memory and the machine works by changing it's internal state, i.e an instruction operates on some data and modifies the data. So inherently, there is state maintained in the sys...
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 th...
I was having a discussion earlier about a state machine, and there was a question as to whether it might not halt on some input. It seems like a property of state machines that is important and frequently mentioned, but I can't for the life of me figure out what the name of that property is. Is there such a term? Is it "haltable", "not...
Hi, I'm developing a software to generate a Turing Machine from a regular expression. [ EDIT: To clarify, the OP wants to take a regular expression as input, and programmatically generate a Turing Machine to perform the same task. OP is seeking to perform the task of creating a TM from a regular expression, not using a regular expre...
Hello everyone! Can you give me 2 different grammars which outputs the same set of words? Illustration: Given a grammar A and B over the alphabet {0,1}, if grammar A can produce the word 0101001, grammar B could as well. If grammar B can produce 0101111 then grammar A could as well. And if grammar A can't produce 01001 then B can neit...
For the uninitiated, Brainfuck is a Turing-complete language with only 8 commands, all of which have literal equivalents in C: bf c ---------------------- > ++ptr; < --ptr; + ++*ptr; - --*ptr; . putchar(*ptr); , *ptr=getchar(); [ while (*ptr) { ] } On any linux distro that has a package manager, you ...
If you take the original Turing machine definition as follows: ...an infinite memory capacity obtained in the form of an infinite tape marked out into squares, on each of which a symbol could be printed. At any moment there is one symbol in the machine; it is called the scanned symbol. The machine can alter ...
I know a little about what is a Turing Machine and a Turing complete language, but to understand better, could someone give examples of languages that are not Turing complete? (maybe machines that are not Turing, as well?) ...
Hello guys, these days I have been studying about NP problems, computational complexity and theory. I believe I have finally grasped the concepts of Turing Machine, but I have a couple of doubts. I can accept that a non-deterministic turing machine has several options of what to do for a given state and symbol being read and that it wil...
I'm trying to understand and implement the simplest turing machine and would like feedback if I'm making sense. We have a infinite tape (lets say an array called T with pointer at 0 at the start) and instruction table: ( S , R , W , D , N ) S->STEP (Start at step 1) R->READ (0 or 1) W->WRITE (0 or 1) D->DIRECTION (0=LEFT 1=RIGHT) N->N...
why is the language of finite prefixes of the number pi decidable by a TM whereas it is false to say there is a TM for any real number that which decides the finite prefixes of that given number? ...
Hi there. I am a final year engineering student. Me and my friends have decided that our final year project would be "Simulation of Turing Machine using Template Metaprogramming". I understand what "Turing Machine" and "Template Metaprogramming" are but my question is why the simulation would be tedious if we design the Turing Machine ...
Hello all, I'm working on a related decidability/recognizable problem, and to solve it, I need clarification about the encoding/representation of a turing machine. I know a turing machine is formally defined as a 7-tuple. If I have a Turing Machine U and another Turing Machine M, is it trivial to design U to recognize some part of M (...