A Universal RAM Machine Resistant to Isolated Bursts of Faults

DSpace Repository

Show simple item record

dc.contributor.author Capuni, Ilir
dc.contributor.author Dervishaj, Ervin
dc.date.accessioned 2013-12-19T13:36:18Z
dc.date.accessioned 2015-11-19T12:50:31Z
dc.date.available 2013-12-19T13:36:18Z
dc.date.available 2015-11-19T12:50:31Z
dc.date.issued 2013-12-19
dc.identifier.uri http://dspace.epoka.edu.al/handle/1/837
dc.description.abstract The most natural question of reliable computation, in every computation model and noise model,is whether given a certain level of noise, a machine of that model exists that canperform arbitrarily complex computations under noise of that level. This question has positive answers for circuits, cellular automata, and recently for Turing machines. Here, we raise the question of the existence of a random access machine that---with some moderate slowdown --- can simulate any other random access machine even if the simulator is subjected to constant size bursts of faults separated by a certain minimum number of steps from each other. We will analyze and spell out the problems and difficulties that need to be addressed in such construction. en_US
dc.language.iso en en_US
dc.relation.ispartofseries paper_31;
dc.subject fault-tolerant computation en_US
dc.subject faults en_US
dc.subject RAM machines en_US
dc.title A Universal RAM Machine Resistant to Isolated Bursts of Faults en_US
dc.type Book chapter en_US

Files in this item

This item appears in the following Collection(s)

  • ISCIM 2013
    2nd International Symposium on Computing in Informatics and Mathematics

Show simple item record

Search DSpace


My Account