Exercises
Multiple Choice
Articles
Open Problems
Login
2 items
Tagged:
turing machine
x
Start over
- to expand, or dig in by adding more tags and revising the query.
Sort By:
trending ▼
date
0
Graduate
By
John Doe
on Nov. 3, 2012 | Updated Dec. 28, 2017
Computability of the space complexity of Turing machines
Show that the space complexity of Turing machines is computable. The space complexity is the partial function \(s:\Sigma^* \times \Sigma^* \to \Sigma^*\) defined as …
Computer Science
Complexity Theory
computability
space complexity
turing machine
0
Undergraduate
By
Shiva Kintali
on June 14, 2012 | Updated Dec. 6, 2017
Left move is decidable
Consider the problem of determining whether a Turing machine on an input \(w\) ever attempts to move its head left at any point during its computation on \(w\). Show that this problem is decidable.
Computer Science
Complexity Theory
turing machine
icon
Sign In or Sign Up
icon
Invite Friends
Post Something
x
Select What You'd Like To Post
POST AN ARTICLE
POST AN OPEN PROBLEM
POST AN EXERCISE
POST A MULTIPLE-CHOICE QUESTION
Content Types
Articles
Open Problems
Exercises
Multiple-Choice Questions
Levels
High school
Undergraduate
Graduate
Subjects
Mathematics
Computer Science
Puzzles
Optimization
Trending tags
trees
dynamic programming
polynomials
infinite series
digraphs
fermats little theorem
asymptotic analysis
differentiation
integration
jee
Topics
Algebra
Algorithms
Approximation Algorithms
Calculus
Combinatorial Optimization
Combinatorics
Complexity Theory
Data Structures
Discrete Mathematics
Game Theory
Geometry
Graph Theory
Linear Algebra
Linear Programming
Logic
Mathematical Analysis
Mathematics
Matrix Theory
Number Theory
Optimization
Probability
Programming
Puzzles
Randomized Algorithms
Real Analysis
Trigonometry
×