A fault-tolerant Turing machine

A fault-tolerant Turing machine

Thesis (Ph.D.)--Boston University PLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would...

Full description

Bibliographic Details
Main Author: Capuni, Ilir
Language:en_US
Published: Boston University 2015
Online Access:https://hdl.handle.net/2144/13608
id ndltd-bu.edu-oai-open.bu.edu-2144-13608
record_format oai_dc
spelling ndltd-bu.edu-oai-open.bu.edu-2144-136082021-10-23T05:01:21Z A fault-tolerant Turing machine Capuni, Ilir Thesis (Ph.D.)--Boston University PLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would like to request open access for it, please contact us at open-help@bu.edu. Thank you. The Turing machine is the most studied universal model of computation. This thesis studies the question if there is a Turing machine that can compute reliably even when violations of its transition function occur independently of each other with some small probability. In this thesis, we prove the existence of a Turing machine that - with a polynomial overhead - can simulate any other Turing machine, even when it is subject to faults of the above type, thereby answering the question that was open for 25 years. 2015-12-08T19:33:33Z 2015-12-08T19:33:33Z 2013 2013 Thesis/Dissertation (ALMA)contemp https://hdl.handle.net/2144/13608 en_US PLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would like to request open access for it, please contact us at open-help@bu.edu. Thank you. Boston University
collection NDLTD
language en_US
sources NDLTD
description Thesis (Ph.D.)--Boston University PLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would like to request open access for it, please contact us at open-help@bu.edu. Thank you. === The Turing machine is the most studied universal model of computation. This thesis studies the question if there is a Turing machine that can compute reliably even when violations of its transition function occur independently of each other with some small probability. In this thesis, we prove the existence of a Turing machine that - with a polynomial overhead - can simulate any other Turing machine, even when it is subject to faults of the above type, thereby answering the question that was open for 25 years.
author Capuni, Ilir
spellingShingle Capuni, Ilir
A fault-tolerant Turing machine
author_facet Capuni, Ilir
author_sort Capuni, Ilir
title A fault-tolerant Turing machine
title_short A fault-tolerant Turing machine
title_full A fault-tolerant Turing machine
title_fullStr A fault-tolerant Turing machine
title_full_unstemmed A fault-tolerant Turing machine
title_sort fault-tolerant turing machine
publisher Boston University
publishDate 2015
url https://hdl.handle.net/2144/13608
work_keys_str_mv AT capuniilir afaulttolerantturingmachine
AT capuniilir faulttolerantturingmachine
_version_ 1719491047984201728

Similar Items