Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Chess Programmers -- take note: M. N. J. van Kervinck's Master's Thesis

Author: Uri Blass

Date: 07:13:00 08/22/02

Go up one level in this thread


On August 22, 2002 at 09:55:38, Sune Fischer wrote:

>On August 22, 2002 at 06:20:00, Mogens Larsen wrote:
>
>>On August 21, 2002 at 18:55:53, Sune Fischer wrote:
>>
>>>It was only a matter of time before you said that, not true of course.
>>
>>Yes, it is. What they do or don't do at your particular institute is completely
>>irrelevant to the general approach to thesis validations in the rest of the
>>country.
>
>I said that the standard seemed low, and it does, to me.
>Problem is that standards vary from low to high, so perhaps it _is_ within range
>at some universities.

My opinion is that it is better if people get respect more for explaining things
and less for discovering new things.

The problem in mathematics is that people get respect for proving things when
almost nobody can understand them.

I know that the proof of perma theorem(x^n+y^n=-z^n has no solution for n>2) is
so complex that almost nobody can understand it.

I think that it is better for mathematics if people devote time not to research
of discovering new theorems but to explaining the proof of the theorem such that
everybody can read the proof and understand every stage of it.

My opinion is that it is going to be better for science if people can get master
thesis and even more than it only for explaining things more clearly.

Uri



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.