Report a bug on this page | Sign in | Create an account

Entries: 207,619 New this week: 124

General search Category finder


advanced search \| help \| use + and * as usual.

Apply to be editor of this category.

Philosophy of Computing and Information > Computation and Physical Systems > Noncomputable Processes

Noncomputable Processes

Related categories

Siblings:

Analog and Digital Computation (14)
Computers (0)
Implementing Computations (4)
Pancomputationalism (7)
Quantum Computation (9)
Computation and Physical Systems, Misc (1)

1 found	Search inside:	(import / add options) Sort by:
Options:	Add an entry to this list: (help) Batch import. Use this option to import a large number of entries from a bibliography into this category. (hide options)

Robert Black (2000). Proving Church's Thesis. Philosophia Mathematica 8 (3).
Arguments to the effect that Church's thesis is intrinsically unprovable because proof cannot relate an informal, intuitive concept to a mathematically defined one are unconvincing, since other 'theses' of this kind have indeed been proved, and Church's thesis has been proved in one direction. However, though evidence for the truth of the thesis in the other direction is overwhelming, it does not yet amount to proof.
Noncomputable Processes in Philosophy of Computing and Information
Philosophy of Mathematics, Miscellaneous in Philosophy of Mathematics
Logic and Philosophy of Logic
The Church-Turing Thesis in Philosophy of Computing and Information
In my reading list | Edit | Categorize | Remove from this list |

My bibliography |

Export citation | Scholar | More..

Off-campus access

Using PhilPapers from home?

Click here to configure this browser for off-campus access.

Monitor this page

Be alerted of all new items appearing on this page. Choose how you want to monitor it:

Email

RSS feed