Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 139-158 |
| Number of pages | 20 |
| Journal | International Journal of Unconventional Computing |
| Volume | 14 |
| Issue number | 2 |
| Publication status | Published - 1 Apr 2019 |
Profiles
-
Davide Rizza
- School of Politics, Philosophy and Area Studies - Associate Professor in Philosophy
- Algebra, Number Theory, Logic, and Representations (ANTLR) - Member
- Philosophy - Member
Person: Research Group Member, Academic, Teaching & Research