Algorithmic Reducibility

Don’t miss the latest post in my “Reason as a Guide to Reality” series.

Maybe it’s because I have a computer science background, but I find the idea that algorithms might be fundamental to reality as intriguing. Is it really true that absolutely everything can be reduced to an algorithm? Here is a teaser:

Interestingly, this ability to reduce all explanations to computable algorithms forms a sort of ‘algorithmic reducibility’ that stands in stark contrast to the more familiar sort of ‘physical reducibility’ we normally think of.  In fact, if it’s true that all explanations have attached algorithms, then ‘algorithmic reducibility’ would seem to play the very role that Reductionists thought particle physics played: if you can’t reduce it to an algorithm, you don’t actually have a full explanation. Therefore this would mean that the theory of computation is actually more fundamental than particle physics.

I realize these posts are a bit ‘harder to get into’ than some. But I really believe an exploration of how we gain knowledge is a fundamental concept to understanding Theology and God.

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>