Subject: Need reference and guidence to acquire the thought process..Help pl.
Message-ID: <Bz41HM.3LD@ccu.umanitoba.ca>
Summary: Need to prepare mysself for proving program complexity.
Keywords: Thought process, proving things.
Sender: news@ccu.umanitoba.ca
Nntp-Posting-Host: ic15.ee.umanitoba.ca
Organization: University of Manitoba, Winnipeg, Canada
Date: Fri, 11 Dec 1992 19:44:09 GMT
Lines: 36
I am a graduate student under going transition from Electrical Engineering to
Computer Engineering. But I think I need a bit of guidance from Pure Math, Abstract Math and Theoretical Computer Science Major.
The problem is two part but the motivation is one
MOTIVATION: I really want to be productive so that I can design proffs
at the level of complexity that is encountered in the Hand book of Theoretical
Computer science and to be able to indentify logical inconsistancies in other peoples proofs. I want to achive these goles in about a years time. I have a back ground of MSC in EE.
PROBLEM:
(i) I can follow the proof ( for example the lower limit proofs of N node d degree graph has routing complexity N**(1/2)/d ). But I am unable to design such a proof
on my own.
(ii) I think, I have a mental blockage when it comes to proof. Also it is quite diffcult for me to follow a brand new proof that is covered in the class in say 50 minutes.
SOLUTION 1:
I have got few books, (i) How to read and do proofs.. Solov
(ii) Problem Solving Through Problems... Larson.
Could you frankly send me short of what to do every day to aquire the mindset
needed for the above.
As for myself, I consider, I am above average when it comes to analytical
skills.
All suggestions will be appreciated.
Tapas Shome
shome@eeserv.ee.umanitoba.ca
--
Parallel Systems are easier to built than to use them---- MIT.
