This talk offers a taxonomy of computing errors based on the level of control we have over the computing method. Error control can be achieved by theoretical, mathematical means but also by practical engineering means. It is far from clear that theoretical error control is epistemically superior to its pragmatic cousin. To underline this point several successful and widely employed computing methods where only pragmatic error control is achieved are examine
In spite of endless discussions about uncertainties the debate about errors is less animated. It mak...
This article discusses how an analogy between algorithms and bureaucratic decision-making could help...
This article discusses how an analogy between algorithms and bureaucratic decision-making could help...
We provide a full characterization of computational error states for information systems. The class ...
We provide a full characterization of computational error states for information systems. The class ...
We provide a full characterization of computational error states for information systems. The class ...
When a computational task tolerates a relaxation of its specification or when an algorithm tolerates...
When a computational task tolerates a relaxation of its specification or when an algorithm tolerates...
We provide a full characterization of computational error states for information systems. The class ...
This survey explores the theory and practice of techniques to make computing systems faster or more ...
This survey explores the theory and practice of techniques to make computing systems faster or more ...
The phenomenon of digital computation is explained (often differently) in computer science, computer...
When a computational task tolerates a relaxation of its specification or when an algorithm tolerates...
Computer programs do not always work as expected. In fact, ominous warnings about the desperate stat...
The book "Computational Error and Complexity in Science and Engineering pervades all the science and...
In spite of endless discussions about uncertainties the debate about errors is less animated. It mak...
This article discusses how an analogy between algorithms and bureaucratic decision-making could help...
This article discusses how an analogy between algorithms and bureaucratic decision-making could help...
We provide a full characterization of computational error states for information systems. The class ...
We provide a full characterization of computational error states for information systems. The class ...
We provide a full characterization of computational error states for information systems. The class ...
When a computational task tolerates a relaxation of its specification or when an algorithm tolerates...
When a computational task tolerates a relaxation of its specification or when an algorithm tolerates...
We provide a full characterization of computational error states for information systems. The class ...
This survey explores the theory and practice of techniques to make computing systems faster or more ...
This survey explores the theory and practice of techniques to make computing systems faster or more ...
The phenomenon of digital computation is explained (often differently) in computer science, computer...
When a computational task tolerates a relaxation of its specification or when an algorithm tolerates...
Computer programs do not always work as expected. In fact, ominous warnings about the desperate stat...
The book "Computational Error and Complexity in Science and Engineering pervades all the science and...
In spite of endless discussions about uncertainties the debate about errors is less animated. It mak...
This article discusses how an analogy between algorithms and bureaucratic decision-making could help...
This article discusses how an analogy between algorithms and bureaucratic decision-making could help...