When have you ever personally come upon the halting problem in the field? This can be when a co-worker / boss suggested a solution which would violate the fundamental limits of computation, or when you realized yourself that a problem you were trying to solve was, in fact, impossible to solve. The most recent time I came up with it was ...
What is a Turing machine and why do people keep mentioning it? My IBM PC is all I need to do my computation! Why does anyone care about these machines? ...
In JFLAP (http://jflap.org), there are some shortcuts for Turing machine transitions. One of these shortcuts allows you to transition as long as the current tape symbol isn't the indicated symbol. For example, the transition !g,x;R basically says "Take this transition if the current tape symbol is not g". So far, so good. But the trans...
I'm currently studying for a discrete mathematics test in which we are learning Chomsky's hierarchy and the type of automatas that recognize each level of the hierarchy. I'm being taught that most computer languages fall within "level 2 and 1" of the hierarchy, but not precisely how. My questions are: What features belong to each lev...
I ask this academically, I want to ask aloud a very important question and have the community try to answer it. Can we build a system that generates a scene to play out along a live anonymous group video chatroom that can read the text typed at it and respond with a chatbot? Live Internet video is often blurry and has low resolution. ...
% calculates the population of a city from year 2000 to 2020 var popstart : int := 80000 var popgrowth : real var popend : real var growthrate : real := 0.03 % popgrowth := popstart * growthrate for i : 2000..2020 by 1 popgrowth := popstart * growthrate end for put "year population" put "==== ==========" put i, " ", popgrowth ...
Whilst doing exam revision I am having trouble answering the following question from the book, "An Introduction to the Theory of Computation" by Sipser. Unfortunately there's no solution to this question in the book. Explain why the following is not a legitimate Turing machine. M = { The input is a polynomial p over variables x1, ...,...
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?) ...
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? ...