ina
Reputation: 19534
Examples of: Circuits can describe computations which are beyond what a Turing machine can do?
Are there examples of circuits that can do what a TM cannot do?
tldr; working through this online course and apparently circuits are more complete than TM? ... is this courseware solution incorrect?
This particular question: https://openlearninglibrary.mit.edu/courses/course-v1:MITx+8.370.1x+1T2018/courseware/Week1/lectures_u1_1/?activate_block_id=block-v1%3AMITx%2B8.370.1x%2B1T2018%2Btype%40sequential%2Bblock%
And the unexpected answer includes the above subject:
Upvotes: 0
Views: 24
Answers (0)
Related Questions
- Finite automata, Pushdown automata and Turing machine examples
- Can a more powerful computing machine (Turing Machine) not decide a problem which can be well decide by less powerful machine in Chomsky hierarchy
- Universal turing machine examples
- How is Turing Machine which accepts nothing is not Recursively Enumerable?
- What it means lambda calculus is equivalent to turing machine
- Why lambda Transitions are not in Turing Machine?
- Can a Turing machine perform Quicksort?
- Can a Turing machine be constructed having only two tape symbols?