{"id":146,"date":"2017-01-27T10:22:20","date_gmt":"2017-01-27T15:22:20","guid":{"rendered":"http:\/\/www.podc.org\/podc2017\/?page_id=146"},"modified":"2021-10-29T10:39:45","modified_gmt":"2021-10-29T14:39:45","slug":"rw-computability-with-speculations","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2017\/rw-computability-with-speculations\/","title":{"rendered":"Recent Advances in<br\/> R\/W Computability with Speculations"},"content":{"rendered":"<p style=\"text-align: center;\"><strong>Tutorial<br \/>\nEli Gafni<\/strong><br \/>\n<strong> Friday, July 28, 2017<\/strong><\/p>\n<p>3 hours with two 10 minutes breaks<\/p>\n<p><strong>\u00a0<\/strong><strong>Tools<\/strong><\/p>\n<ol>\n<li>The Extended BG Simulation.<\/li>\n<li>Generalized Universality and the resultant ER (Eli-Rachid) simulation.<\/li>\n<li>GACT: Generalized Asynchronous Computability Theorem.<\/li>\n<li>Constructive Convergence algorithm for Affine complexes.<\/li>\n<li>Objects as Tasks.<\/li>\n<li>Solving tasks by the cumulative set consensus power of available objects.<\/li>\n<li>The demise of the Byzantine.<\/li>\n<\/ol>\n<p><strong>\u00a0<\/strong><strong>Vision<\/strong><\/p>\n<ol>\n<li>Tasks are the \u201cfunction\u201d of Distributed Computing (DC)<\/li>\n<li>Church-Thesis for DC: Any reasonable (causal) framework, MP, Objects, etc., properly extended (e.g. composite objects) gives rise to the same set of time stationary models.<\/li>\n<li>The models above correspond to Affine complexes and those are decidable. Hence deterministic objects (and composite) correspond to affine tasks and are robust and decidable.<\/li>\n<li>The Wait-Free model is Universal: Given a task <em>T <\/em>and a model <em>M<\/em>, there exist a task <em>T<\/em>(<em>M<\/em>) solvable wait-free iff <em>T <\/em>is solvable in <em>M<\/em>.<\/li>\n<\/ol>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Tutorial Eli Gafni Friday, July 28, 2017 3 hours with two 10 minutes breaks \u00a0Tools The Extended BG Simulation. Generalized Universality and the resultant ER (Eli-Rachid) simulation. GACT: Generalized Asynchronous Computability Theorem. Constructive Convergence algorithm for Affine complexes. Objects as Tasks. Solving tasks by the cumulative set consensus power of available objects. The demise of &hellip; <a href=\"https:\/\/www.podc.org\/podc2017\/rw-computability-with-speculations\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Recent Advances in<br \/> R\/W Computability with Speculations&#8221;<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-146","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2017\/wp-json\/wp\/v2\/pages\/146","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2017\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2017\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2017\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2017\/wp-json\/wp\/v2\/comments?post=146"}],"version-history":[{"count":4,"href":"https:\/\/www.podc.org\/podc2017\/wp-json\/wp\/v2\/pages\/146\/revisions"}],"predecessor-version":[{"id":150,"href":"https:\/\/www.podc.org\/podc2017\/wp-json\/wp\/v2\/pages\/146\/revisions\/150"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2017\/wp-json\/wp\/v2\/media?parent=146"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}