 The idea is also given formal expression in the so-called ‘No-Free-Lunch theorems’ (Wolpert 1992, 1996, 1997). These can be interpreted as versions of the argument in Hume’s first fork since they establish that there can be no contradiction in the algorithm not performing well, since there are a priori possible situations in which it does not (Sterkenburg and Grünwald 2021:9992). Given Hume’s premise  P3,  this rules out a demonstrative argument for its good performance.