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 answers
Related Questions in COMPUTER-SCIENCE
- what's the difference between "nn layout" and "nt layout"
- Theory of Comp Sci - State Diagrams NFAs
- What is devops meaning ? What requirement?
- How to test that a specific sorting algorithm was actually implemented?
- Creating a more efficient algorithm for taking the third largest difference an element has with another element in the list in python
- Theory of computer science problems
- Choosing a sequence of bitwise operations
- How to determine the time complexity of a recursive function that has a loop enclosed in it?
- Find median in constant time O(1)
- The factorial of an inputted number in Flowgorithm
- How come checking for printable bytes is faster with the "in" operator rather than interval comparisons?
- PageRank Algorithm on a Graph with a Sink Node
- recursion relation problem solve only using back substitution method
- Integrating Jenkins CI/CD with WinDev Framework for Academic Project
- Formatting multiplication tables in python; not how to, just some explanation
Related Questions in TURING-MACHINES
- Understanding Unary PCP Reduction to a Matching Problem (UPCP)
- Build a Turing Machine that counts a's and b's
- Language for Turing Machine
- Unable to export Chains class from Julia's Turing library
- Complicated, long equations in MCMC [Julia, Turing.jl]
- Turing Pattern Formation
- Is there a way to prove that the intersection of a decidable language and a recognizable language is also recognizable?
- binary search with JFLAP turing machine
- python - 3 Turing Machine script, getting errors on an undefined variable, even though I assigned it
- Prove that the following problem is undecidable by a reduction from the halting problem:
- Construct a Turing Machine that halts on an unbroken string of 1s
- Jump to a specific vector place if a condition is met and start reading it from there
- Binary to unary turing machine
- How to generate an Unrestricted grammar if a language defination is given
- Can we assure a strictly decreasing function is computable?
Related Questions in AUTOMATA-THEORY
- how to model and verify model
- Context Free Grammar for L= { a^n b^m c^m d^2n }, where n and m are >= 0
- NFA or e-NFA for the condition , n % 5 = 0 where n is the number of 1s
- Is there a parsing algorithm for languages generated by context-sensitive grammars?
- If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is?
- Automata theory: Formal definition of indistinguishable & distinguishable strings and example confusion
- Can epsilon production be assumed in a left recursive grammar
- Prove that the following problem is undecidable by a reduction from the halting problem:
- what is the Context-Free Grammar for the following language?
- DFA- Set of all strings whose 10th symbol from the right end is 1
- Can we transfer every DFA to DFAs with start state having no in edge?
- NFA or DFA accepting # of positions of 4k between 0's
- Regular expression for odd length of a's and odd length of b's
- Using bracket for automata
- unable to display tables and diagrams in python for non deterministic finite automata
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?
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)
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).