The new computational methodology due to Yaroslav Sergeyev (see [25–27]) makes it possible to evaluate numerically the terminal features of complete, sequential decision-making processes. By standard numerical methods, these processes have indeterminate features or seem to support paradoxical conclusions. We show that they are better regarded as a class of problems for which the numerical methods based on Sergeyev’s methodology provide a uniform technique of resolution.
|Number of pages||20|
|Journal||International Journal of Unconventional Computing|
|Publication status||Published - 1 Apr 2019|
- School of Politics, Philosophy, Language and Communication Studies - Associate Professor in Philosophy
- Philosophy - Member
Person: Academic, Teaching & Research