Editing Computational irreducibility (section)

==Compatibilism==

[[Marius Krumm]] and [[Markus P Muller (physicist)|Markus P Muller]] tie computational irreducibility to [[Compatibilism]].<ref>Computational irreducibility and compatibilism: towards a formalization https://arxiv.org/pdf/2101.12033.pdf</ref> They refine concepts via the intermediate requirement of a new concept called [[computational sourcehood]] that demands essentially full and almost-exact representation of features associated with problem or process represented, and a full no-shortcut computation.  The approach simplifies conceptualization of the issue via the ''No Shortcuts'' metaphor.  This may be analogized to the process of cooking, where all the ingredients in a recipe are required as well as following the 'cooking schedule' to obtain the desired end product. This parallels the issues of the profound distinctions between similarity and identity.