Turing Definition and 66 Threads

so my project is on reaction diffusion equations in 2d. i have been asked to reproduce known and published work to start off with and the system is the brusselator equations with diffusion terms. to put it simply my program doesn't work. now the parameter values for the equations are taken from...

Can anyone help me...from Nielsen-Chuang "quantum computation and quantum information":how might we recognize that a process in nature computes a function not computable by a turing machine?

From Nielsen-Chuang:how might we recognize that a process in nature computes a function not computable by a turing machine?

Hello, guys. I'm a dualist - that is, I believe that conciousness, thoughts and intelligence are not driven by material particles and laws of physics as we currently know. I also believe in God, for that matter. Now check this: physical world has its own "computational complexity class", i.e...

Hello smart people, I am wondering if there is a process to convert a function to a Turing Machine. In other words, if I provide a list of input strings , and a corresponding output string for each input string, is there a way to find the minimum number of instructions to realize any function...

hello, One can wonder what is the relation between the title of this thread and the subject of quantum mechanics, well, i was reading in a book about quantum computation and information and it was talking about computer science in some chapter where it shows a basic understanding of Turing...

Hello, I want to express Non-Deterministic Turing Machine constraint with boolean expression. The constraint is: "Cells which aren’t being read remain the same at time t+1". lets say H[i,j] means the read/write head at time i at cell j and S[i,j,k] means the symbol k at time i in cell j so the...

As a summer project I was thinking of building an entirely mechanical Turing machine - possibly with Lego. Has anyone attempted this? Does anyone have any advice on how to design this? Thanks.

Okay, so if I have a turing machine so called M, is there a configuration alpha s beta which yields a configuration with state q? If it's decidable can someone explain the algorithm to proceed?

Homework Statement I need to construct and describe work od Touring machine which will calculate the value of logical expression with Boolean operators AND and OR. The simbol of input track which match logic operator AND is *, and simbol od input track that match logic operator OR is +...

Complement of Universal Turing Machine - Does this exist?? I am kind of confused in terms of the creation of machine which does NOT (Universal Turing Machine). I mean I construct a TM which will simulate UTM and accept strings it rejects and rejects strings it accepts. So if L(UTM) defined as...

This may be a bit vague, as I don't remember all the details. When proving Turing's halting problem, at some point you will say something along the lines of, "given a list of all Turing Machines, assume that there exists a Turing Machine M which decides whether machine A halts on input B". The...

Homework Statement A two-dimensional Turing machine has the usual finite-state control but a tape that is a two-dimensional grid of cells, infinite in all directions. The input is placed on one row of the grid, with the head at the left end of the input and the control in the start state, as...

How can one readily determine that the reality one experiences is real, not virtual - perhaps through Turing machine logic?

This was a bonus problem that I missed on the last homework. A paper tape Turing machine (PTM) is a Turing machine whose tape alphabet is partially ordered, and if a is a symbol on a square of the tape, then b can only be written on that square if b is greater than a in the partial order...

Sorry if this is a wrong place to post this. What does it mean that a turing machine M recognize language A? Does it mean that A={w|M accepts w}? Is so then how does M accept w? Does it accept w if it ends in accept state?