Computer Science – Computational Complexity
Scientific paper
2012-03-06
Computer Science
Computational Complexity
Scientific paper
We consider computations of a Turing machine under noise that causes consecutive violations of the machine's transition function. Given a constant upper bound B on the size of bursts of faults, we construct a Turing machine M(B) subject to faults that can simulate any fault-free machine under the condition that bursts are not closer to each other than V for an appropriate V = O(B^2).
Capuni Ilir
Gacs Peter
No associations
LandOfFree
A Turing Machine Resisting Isolated Bursts Of Faults does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Turing Machine Resisting Isolated Bursts Of Faults, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Turing Machine Resisting Isolated Bursts Of Faults will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-392628