Re: THIS STATEMENT HAS NO PROOF IN ANY SYSTEM = true or false?
From: Torkel Franzen (torkel_at_sm.luth.se)
Date: 01/18/05
- Next message: Eric_Smith: "[Two algebra problems] Help me please"
- Previous message: Ross A. Finlayson: "Re: On Well-Ordering(s) and Sets Dense in the Reals, Infinity"
- In reply to: Ajoy K Thamattoor: "Re: THIS STATEMENT HAS NO PROOF IN ANY SYSTEM = true or false?"
- Next in thread: Ajoy K Thamattoor: "Re: THIS STATEMENT HAS NO PROOF IN ANY SYSTEM = true or false?"
- Reply: Ajoy K Thamattoor: "Re: THIS STATEMENT HAS NO PROOF IN ANY SYSTEM = true or false?"
- Messages sorted by: [ date ] [ thread ]
Date: 18 Jan 2005 05:38:56 +0100
Ajoy K Thamattoor <ajoyk@cs.stanford.edu> writes:
> Yes, each computable function is computable with an
> algorithm (in other words, recursive), but the set of computable
> functions would be uncountably infinite.
There are only countably many algorithms.
- Next message: Eric_Smith: "[Two algebra problems] Help me please"
- Previous message: Ross A. Finlayson: "Re: On Well-Ordering(s) and Sets Dense in the Reals, Infinity"
- In reply to: Ajoy K Thamattoor: "Re: THIS STATEMENT HAS NO PROOF IN ANY SYSTEM = true or false?"
- Next in thread: Ajoy K Thamattoor: "Re: THIS STATEMENT HAS NO PROOF IN ANY SYSTEM = true or false?"
- Reply: Ajoy K Thamattoor: "Re: THIS STATEMENT HAS NO PROOF IN ANY SYSTEM = true or false?"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
