Berkeley CSUA MOTD:2000:July:03 Monday <Sunday, Tuesday>
Berkeley CSUA MOTD
2000/7/3-4 [Computer/SW/P2P] UID:18577 Activity:high
7/3     motd vaporized
        \_ You bit buster, you.
           \_ Reduce, reuse, recycle
              \_ Hey baby, I'll show you my bits if you show me yours.
                \_ I saw yours in kindergarten.  Wasn't that big a deal.
                \_ Is bit-sharing safe?
                   \_ If done correctly it can be safer.  Bit sharing is never
                      100% safe.
                        \_ if your bit is private, then it is 100% safe.
                           But if it is protected then it is only 98% safe.
                           Public bit not safe at all.
           \_ Byte my bits.
2000/7/3-4 [Uncategorized] UID:18578 Activity:kinda low
7/3     Where can i get a copy of CloneCD?
            \_ "What IS it?" (to quote Barry from RE)
2000/7/3-4 [Uncategorized] UID:18579 Activity:nil
7/3     Test yourself silly:
2000/7/3-4 [Computer/HW/Memory, Computer/SW/Languages/Functional] UID:18580 Activity:insanely high
7/3     Is it possible to derive a mathematical or logical proof which shows
        that, given a set of computations to perform, an instruction set
        consisting of only push/pop instructions (1 register) requires less
        memory footprint than that of a general purpose registered machine?
        \_ java troll, go away
        \_ Wow.  Berkeley is graduating idiots like this?
                \_ hot market + idiot programmers = old news
                \_ awww, cut the kid some slack -- ignorance != stupidity.
                   just chalk it up to being naive, inexperienced, and
        \_Would someone please explain exactly what the poster is asking, and
          why it's ridiculous?  What does it have to do w/ java?
                \_ cs152+252 would help
                   \_ cs164 talked about it a little
                \_ More like who cares?  Memory footprint ceased being deeply
                   meaningful after BG chewed on those "more 640k" words.  RAM
                   is cheap and other kinds of higher density storage are
                   always in the works.  Don't bother me kid.
                \_ just like soda to call someone stupid, then not be able
                   to answer (ooh, I'm too busy to answer, but have plenty of
                   time to carp). ehe.
                   \_ Didn't say you're stupid.  Said it isn't important.
        \_ i dare you to to write a loop using push/pop.
           \_ (define (loopy numtimes doit result)
                  (if (= numtimes 0)
                      (loopy (1- numtimes)
                             (cons (doit numtimes) result))))
                ITERATION = RECURSION = stacks (with push = cons)
                \_ NO!  With the assembly push/pop instructions.  Not LISP
                   _simulating_ push/pop.  You don't get "cons" and if/then
                   tests in a push/pop-only instruction set.  Read the test
                   question fully before answering.  Grade: F.
        \_ I think the guy who invented Forth wrote a whole book about when
        stack architectures are better that general purpose RISC and I read
        it online, but I don't have the URL anymore.    -muchandr
        \_ Found it. I ment this guy really:
        For example section 7.2.3 deals with rule-based systems being faster.
        Another good page has an example
        on how you can do better because of better instruction bandwidth of
        8-bit zero-operand instructions
                \_ dude, heavy computer science! The poster isn't as clueless
                   as I thought.
Berkeley CSUA MOTD:2000:July:03 Monday <Sunday, Tuesday>