Friday, July 28, 2017
3 hours with two 10 minutes breaks
- 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 the Byzantine.
- Tasks are the “function” of Distributed Computing (DC)
- 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.
- 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.
- The Wait-Free model is Universal: Given a task T and a model M, there exist a task T(M) solvable wait-free iff T is solvable in M.