The Turing machine is apparently an important concept in theoretical computer science. I myself am a complete novice in computer science, but I've heard of it repeatedly in other contexts. Until now, however, I've never understood the purpose of the concept of a " non-deterministic Turing machine " (NTM): As far as I understand from…
Hello everyone, I have a question for anyone who is knowledgeable about computer science or has studied computer science. Given a function f: R -> R with f(x) = pi – 2^x. In the lecture, the question arose as to whether this function is computable. My reasoning was that this might not be the case,…
The program always stops at the plus sign. Why? I previously adjusted the code so that the two numbers are added together. Enter 110+10 into the simulator. Load, start name: Addierer init: z0 accept: zE // Fahre nach ganz rechts auf der ersten Zahl z0,0 z0,0,> z0,1 z0,1,> z0,_ z0,_,> z0,+ z0,+,> // Suche das…
Hello, I should specify a Turing machine that shifts a 1 to the right, reducing the distance to another 1 by a 0. How can this be specified? Do I have to start on the far left/right? LG
In reality, you only want to send cryptocoins from A to B anyway. So what's the point of Ethereum, for example, being Turing-complete?
Let L be a decidable language. Show that the language L′ is also decidable, where L′ = {w | w · w^r ∈ L}, and w · w^r is the concatenation of the word w with its inverse. Can anyone help me with this?
I have this Turing machine that works as an acceptor and accepts all words (01v010v001)*. In the second Everything is shown in the image. q0 is the starting state, and qF is a trap (error state). I have a question about simplification. If I go from q0 to q1, then to q2, and finally to…
Hello, How is the current state changed in Turing machines? Is the corresponding notation absolute or relative to the current state? Example: State 0: (0, 1, R, 1) Condition 1: (0, 0, R, 0) If a 0 is read in state 1, then a 0 is written and the write head moves to the right….
Can someone please help me with my homework? I don't know what to do 🙁 If someone could explain this to me that would be great. "The input/output tape of a Turing machine can hold either a one (1), a zero (0), or a space (B) in each cell. A Turing program must be specified…
Hello, I have the task of drawing a DEA automaton as a diagram. The Alphabet is given. The task is to create an automaton as a diagram, whose language is is defined . Would the following diagram be a solution to this problem? I also have the question of whether DFA automata are Turing…