| dc.contributor.author | Rayo, Agustín | |
| dc.contributor.author | Evans, Owain R. | |
| dc.coverage.temporal | Spring 2013 | |
| dc.date.accessioned | 2019-12-16T18:42:22Z | |
| dc.date.available | 2019-12-16T18:42:22Z | |
| dc.date.issued | 2013-06 | |
| dc.identifier | 24.118-Spring2013 | |
| dc.identifier.other | 24.118 | |
| dc.identifier.other | IMSCP-MD5-de73fba920a38a33b22f3690362e96f3 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/123297 | |
| dc.description.abstract | This course explores different kinds of infinity; the paradoxes of set theory; the reduction of arithmetic to logic; formal systems; paradoxes involving the concept of truth; Gödel’s incompleteness theorems; the nonformalizable nature of mathematical truth; and Turing machines. | en |
| dc.language.iso | en-US | |
| dc.rights | This site (c) Massachusetts Institute of Technology 2019. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license") unless otherwise noted. The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions. | en |
| dc.rights | Attribution-NonCommercial-ShareAlike 3.0 Unported | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | * |
| dc.subject | time travel | en |
| dc.subject | free will | en |
| dc.subject | Newcomb | en |
| dc.subject | Newcomb's Paradox | en |
| dc.subject | probability | en |
| dc.subject | Zeno | en |
| dc.subject | Zeno's Paradox | en |
| dc.subject | infinity | en |
| dc.subject | axiom of choice | en |
| dc.subject | computability | en |
| dc.subject | Godel | en |
| dc.subject | Godel's theorem | en |
| dc.subject | prisoner's dilemma | en |
| dc.subject | higher infinite | en |
| dc.title | 24.118 Paradox & Infinity, Spring 2013 | en |
| dc.title.alternative | Paradox & Infinity | en |
| dc.type | Learning Object | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Linguistics and Philosophy | |
| dc.audience.educationlevel | Undergraduate | |
| dc.subject.cip | 270502 | en |
| dc.date.updated | 2019-12-16T18:42:30Z | |
