Re: debate: to get a Master's Degree in CS or Not
- From: Gerry Quinn <gerryq@xxxxxxxxxxxxxxxxxxx>
- Date: Fri, 3 Feb 2006 13:17:42 -0000
In article <0KtEf.161278$AP5.57011@edtnps84>, owong@xxxxxxxxxxxxxx
says...
"Gerry Quinn" <gerryq@xxxxxxxxxxxxxxxxxxx> wrote in message
news:MPG.1e285c613318276898a942@xxxxxxxxxxxxxxxxxxx
I would say mathematics is the construction of lists of strings, each
string generated by performing one of several specified operations on a
previous string.
I believe Gödel tried something like this, and found that there are some
aspects of Math that cannot be captured by the construction of strings via
rules or operations. Gödel's incompleteness theorem.
No, Godel's incompleteness theorem is just a string that can be
interpreted as saying something about the classification of strings in
the lists of strings that comprise the theorems of a formal system.
In brief, it says that if a formal system of a certain complexity does
not produce both a string "x" and a string "!x" for any x, it is
possible to construct a string y such that neither "y" nor "!y" will be
produced by that system.
- Gerry Quinn
.
- References:
- Re: debate: to get a Master's Degree in CS or Not
- From: Oliver Wong
- Re: debate: to get a Master's Degree in CS or Not
- Prev by Date: Re: Retired programmer wants to learn programming
- Next by Date: Re: Starting
- Previous by thread: Re: debate: to get a Master's Degree in CS or Not
- Next by thread: Re: debate: to get a Master's Degree in CS or Not
- Index(es):
Relevant Pages
|