www.delorie.com/archives/browse.cgi | search |
Xref: | news-dnh.mv.net comp.os.msdos.djgpp:1272 |
Path: | news-dnh.mv.net!mv!news.sprintlink.net!gatech!cs.utk.edu!duncan.cs.utk.edu!doolin |
From: | doolin AT duncan DOT cs DOT utk DOT edu (David Doolin) |
Newsgroups: | comp.os.msdos.djgpp |
Subject: | Re: How do I get djgpp? |
Date: | 31 Jul 1995 11:28:56 GMT |
Organization: | University of Tennessee Computer Science |
Lines: | 18 |
Distribution: | world |
References: | <3vckm3$ksm AT post DOT tau DOT ac DOT il> <3vdd7qINNrn6 AT CS DOT UTK DOT EDU> <301ae929 DOT sandmann AT praline DOT no DOT NeoSoft DOT com> <3vh259INNqbu AT CS DOT UTK DOT EDU> <DCKBLE DOT HzJ AT hpcvsnz DOT cv DOT hp DOT com> |
Reply-To: | doolin AT cs DOT utk DOT edu |
Nntp-Posting-Host: | duncan.cs.utk.edu |
To: | djgpp AT sun DOT soe DOT clarkson DOT edu |
Dj-Gateway: | from newsgroup comp.os.msdos.djgpp |
In article <DCKBLE DOT HzJ AT hpcvsnz DOT cv DOT hp DOT com>, jimb AT mcm DOT hp DOT com (Jim Belesiu) writes: |> : I will add only one thing: strap yourself in, |> : 'cause the learning curve is steep! |> |> Umm, you mean shallow. If one plots knowledge as a function of time, then |> a "steep" leaning curve is good. Or did you mean that one will learn so |> much so quickly that you indeed have a "steep" learning curve and the |> restraints are needed to keep your cortex attached :) |> |> -- |> ___ |> Diagnostic / / Jim Belesiu |> Cardiology HEWLETT /hp/ PACKARD jimb AT mcm DOT hp DOT com |> Division /__/ McMinnville, Oregon USA Whatever. Steep as in `hard to climb'? I bow out of this meta-discussion now. Dave D
webmaster | delorie software privacy |
Copyright © 2019 by DJ Delorie | Updated Jul 2019 |