HackerPapers

arXiv:1805.08347cs.AI

How To Solve Moral Conundrums with Computability Theory

Min Baek

Abstract

Various moral conundrums plague population ethics: the Non-Identity Problem, the Procreation Asymmetry, the Repugnant Conclusion, and more. I argue that the aforementioned moral conundrums have a structure neatly accounted for, and solved by, some ideas in computability theory. I introduce a mathematical model based on computability theory and show how previous arguments pertaining to these conundrums fit into the model. This paper proceeds as follows. First, I do a very brief survey of the history of computability theory in moral philosophy. Second, I follow various papers, and show how their arguments fit into, or don't fit into, our model. Third, I discuss the implications of our model to the question why the human race should or should not continue to exist. Finally, I show that our model may be interpreted according to a Confucian-Taoist moral principle.

arXiv comments
Conclusion is incorrect
Journal reference
DOI
Subjects
cs.AIArtificial Intelligence cs.CYComputers and Society cs.LOLogic in Computer Science

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 1 thread, from Jan 2019 to Jan 2019.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Gödel's Theorem 2 comments
    • For some reason it's fashionable to bash philosophical implications of Gödel's Theorem(s). Not only is the internet filled with articles like this, there is at least one book dedicated to bashing on philosophical implications of the theorem, the one by Torkel Franzen (whose most…

      jeromebaekView on HNParent context

    • > In fact, Godel's theorem ought to be used more, not less, in philosophy. Some, like me, believe it has profound implications to moral philosophy. See: https://arxiv.org/abs/1805.08347 I've only skimmed it, and I'm not very familiar with moral philosophy, but this seems…

      duckerudeView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.