home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!wupost!darwin.sura.net!uvaarpa!concert!borg!news_server!martinc
- From: martinc@hatteras.cs.unc.edu (Charles R. Martin)
- Newsgroups: comp.software-eng
- Subject: Re: Productivity vs. Complexity
- Message-ID: <MARTINC.92Nov19142245@hatteras.cs.unc.edu>
- Date: 19 Nov 92 19:22:45 GMT
- References: <1992Nov18.235235.423@eecs.nwu.edu>
- Sender: winslett@cs.unc.edu
- Distribution: na
- Organization: UNC Department of Computer Science
- Lines: 11
- In-reply-to: travis@eecs.nwu.edu's message of 18 Nov 92 23:52:35 GMT
-
- Let me try saying that again: obviously the KCS complexity of the *same*
- function will always be the same assuming the same reference model of
- computation. What I really meant was that the complexity of functions
- commonly realized in hardware is much smaller than the functions that are
- realized with software.
- --
- Charles R. Martin/(Charlie)/martinc@cs.unc.edu
- Dept. of Computer Science/CB #3175 UNC-CH/Chapel Hill, NC 27599-3175
- 3611 University Dr #13M/Durham, NC 27707/(919) 419 1754
- "Oh God, please help me be civil in tongue, pure in thought, and able
- to resist the temptation to laugh uncontrollably. Amen." -- Rob T
-