×
Log in
Upload File
Most Popular
Study
Business
Design
Technology
Travel
Explore all categories
The top documents tagged [turing machine t]
Understanding Alan Turing and his Scientific Legacy 1912-1954
223 views
Decidable A problem P is decidable if it can be solved by a Turing machine T that always halt. (We say that P has an effective algorithm.) Note that the
218 views
Complexity 7-1 Complexity Andrei Bulatov Complexity of Problems
241 views
Complexity 11-1 Complexity Andrei Bulatov Space Complexity
258 views
Complexity 5-1 Complexity Andrei Bulatov Complexity of Problems
252 views