I know for example finding integers where their modulus n is k maps nicely to finite state machines and push down automata's work well for parsing deterministic grammars. I was wondering if there are any problems that are like that for turing machines.
Are there any problems that are easier to implement on a turing machine than a conventional computer?
98 Views Asked by J. Rehbein At
1
There are 1 best solutions below
Related Questions in COMPUTER-SCIENCE
- 2D array - making it "torus" like
- How to get samples of different paths?
- How do I keep track of path in TSP?
- Need workaround to treat float values as tuples when updating "list" of float values
- How does a loop work at the lowest level
- Solving a complex recurrence relation for the Traveling Salesman
- Would this function be O(n^2log_2(n))?
- Watermark in a textbox c#/cs/aspx
- Writing a Recurrence Equation
- How to run Athena | Coq | Isabelle codes remotely?
- Computer Architecture/Assembly, Amdahl's Law
- Why is it that some user defined C++ functions won't work with big numbers?
- Quicksort Q: Finitely many distinct keys
- Computer architecture - How to find the addresses in a block
- Table seating, what algorithm to use?
Related Questions in TURING-MACHINES
- Direct Reduction, Turing machine and a DFA
- Is $E_{LBA}$ a Turing recognizable language?
- Is there a way to get an accepted input from a Turing Machine?
- How to simulate f(1^n)=1^y where y=1+2+...n in Turing Machine Simulator?
- What elements does a turing complete programming language need to consist of?
- How do I find largest subsequence in turing?
- Does there exist a TM for all countable languages?
- Showing turing machines exist for the following
- Turing Machines and Lambda Calculus equivalence
- Turing Machine that finds even or odd length
- Is this language decidable, recognizable, or unrecognizable?
- How to convert a DFA to a Turing machine?
- How do I get this section of code to run until the tape is done?
- Number of Turing Machines?
- How is Turing Machine which accepts nothing is not Recursively Enumerable?
Related Questions in AUTOMATA-THEORY
- Grammar for a^n
- Can final and non-final states having identical configurations be merged together in a minimal DFA?
- Finding DFA of r* when r and DFA of r were deifined
- How to call a structured language that cannot loop or a functional language that cannot return
- What regular language intersects with 1*0* gives 1n0n
- Context free grammar for this language
- What type of languages are accepted by a PDA in which stack size is limited?
- Finiteness of Regular Language
- Notation for concat in set theory
- Python implementation for the CYK Algorithm
- CFG for a = b and c = d (length)
- In Context Free Grammer, do we replace all variable during a substitution? or can we apply substitution rule to only of the variable of same type?
- When to use Ø for states in DFA / NFA
- Design a turing machine to accept {1^n : n is prime number}
- How L={ww^Rx| where w, x belongs to {a,b}^* } is a regular language?
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
As mentioned by tia, these kinds of questions are better for cs.stackexchange.com. I would say that the question is not well stated, since conventional computers are basically a type of Turing machine. It depends on what kind of Turing machine you are working with. For example, many problems can be solved much faster on a non-deterministic Turing machine than on a classical computer (which is deterministic).