Search found 16 matches

by rabuf
Fri Apr 16, 2010 10:06 pm UTC
Forum: Hardware
Topic: Building a miniature desktop
Replies: 24
Views: 3251

Re: Building a miniature desktop

For heavy photoshop, a good graphics card is advised, normally. sense, this does not make. what one needs for photoshop: fast CPU: yes, much RAM: yes, fast hdd:doesn't hurt , GPU:no you don't a 4MB PCI card without any 3d acceleration will do photoshop just as good as some 4GB SLI supersetup. photo...
by rabuf
Thu Mar 04, 2010 2:39 am UTC
Forum: Logic Puzzles
Topic: Those really good logic puzzles
Replies: 38
Views: 10249

Re: Those really good logic puzzles

Solution to the Self Referential Aptitude Test (http://www.dougb.com/srat.html) D A D B E D D E D A B A D B A D B A E B Haven't gone through to see if thats the only answer yet. I too enjoyed this puzzle back when I was first introduced to it. Here's an interactive version of it that checks you...
by rabuf
Fri Feb 05, 2010 11:51 pm UTC
Forum: The Help Desk
Topic: Octave Issues
Replies: 5
Views: 1033

Re: Octave Issues

I'm taking a numerical analysis class that is Matlab dependent, but I'm cheap and an oss fanatic, so I'm trying to use octave. This isn't really an issue, but I can't figure out how to get scripts to work. For my first assignment I have a function I'd like to test (and use), but none of the instruc...
by rabuf
Thu Nov 12, 2009 3:21 am UTC
Forum: Coding
Topic: Googles new programming language: Go
Replies: 33
Views: 2758

Re: Googles new programming language: Go

Um, Fortran is still a significant language? Yes. In engineering, mathematics, and high performance computing fortran is still commonly used. There is a massive amount of code written for it which supplies the basic (and not so basic) algorithms the practitioners in these fields require. Code that ...
by rabuf
Thu Nov 12, 2009 1:55 am UTC
Forum: Coding
Topic: Googles new programming language: Go
Replies: 33
Views: 2758

Re: Googles new programming language: Go

Earlz wrote:The only ones I can name off are C, C++, D, Delphi/Pascal, and um...


...Fortran, BASIC (yech!), Forth, Common Lisp, Ada, Dylan, Eiffel, SML, OCaml...
by rabuf
Thu Nov 12, 2009 1:44 am UTC
Forum: Coding
Topic: Concurrent programming
Replies: 13
Views: 1667

Re: Concurrent programming

Further information on what systems you can access would be useful. OpenMPI: If you already have the code written in C, OpenMPI can be used to (a little less easily, more dealing with it's API calls) to distribute these tasks across a cluster. I used this on a (dumb) raytracer program once, it was f...
by rabuf
Tue Oct 13, 2009 11:03 pm UTC
Forum: Religious Wars
Topic: The Turing Machine vs. Lambda Calculus
Replies: 32
Views: 21257

Re: The Turing Machine vs. Lambda Calculus

The Turing Machine is nicer, because it's a lot like actual computers, while Lambda Calculus is "out of this world". I doubt you can implement a machine that evaluates lambda expressions natively. If you consider lisp (specifically scheme) sufficiently close to the \lambda -calculus, then...
by rabuf
Fri Sep 26, 2008 2:32 am UTC
Forum: Coding
Topic: Sieve of Eratosthenes [SOLVED]
Replies: 7
Views: 2422

Re: Sieve of Eratosthenes

As Xanthir said, the parens don't match. However, that's not the only problem. Filter is also not defined properly, and required some alterations to run correctly on it's own. Something to keep in mind about Scheme: (symbol) is evaluated as a function call. Your code contains several function calls ...
by rabuf
Mon Apr 21, 2008 10:49 pm UTC
Forum: Gaming
Topic: Mass Effect : Meet and Fuck
Replies: 277
Views: 91368

Re: Mass Effect

although i was pretty miffed by the devil's plan to make Mass Effect a franchise forever and ever . Why does every new game nowadays (read: every new IP for EA) have to be beaten with the money stick? Original ideas FTW! Mass Effect isn't the sort of game that can be repeated so easily; i'd like to...
by rabuf
Thu Apr 17, 2008 8:23 pm UTC
Forum: Computer Science
Topic: Tail Recursion
Replies: 18
Views: 4055

Re: Tail Recursion

Recursive functions are functions defined in terms of themselves. Tail recursion is a special case where the recursive call is the last operation in the instruction. C/C++/Java all allow for tail recursion. What their compilers may not do is optimize those into iterative routines rather than recursi...
by rabuf
Mon Apr 07, 2008 3:59 pm UTC
Forum: Mathematics
Topic: Roll all 6s
Replies: 12
Views: 2834

Re: Roll all 6s

What is the most likely number of rolls needed to turn 23d6 into 6s? Nd6? NdD into Ds? Average? The way I'm interpreting this uses the negative binomial distribution (see wikipedia or MathWorld for more discussion of it). This distribution describes the scenario where you have Y failures before you...
by rabuf
Sat Apr 05, 2008 5:52 pm UTC
Forum: General
Topic: Who the dickens are you?
Replies: 10922
Views: 2348637

Re: INTRO THREAD THE THIRD

Hi, My name is Rabuf (old name I used gaming back in the day), 25, living in North Carolina at the moment. I'm currently finishing up my MS degree in computer science (hopefully by December), and have undergrad degrees in CS and math. Anything else, ask. I have a tendency to not reply quickly so don...
by rabuf
Fri Apr 04, 2008 1:32 pm UTC
Forum: Coding
Topic: worst bugs ever (or your most hated)
Replies: 196
Views: 21887

Re: worst bugs ever (or your most hated)

For ActionScript 3.0's switch/case see switch/case definition and strict equality . According to these, your switch/case code is actually equivalent to: if (myxml.somenode === "title") {...} else if (myxml.somenode === "somethingelse") {...} The difference is '===' instead of '==...
by rabuf
Thu Apr 03, 2008 1:47 pm UTC
Forum: Computer Science
Topic: suggestions for computer science books
Replies: 12
Views: 2687

Re: suggestions for computer science books

Yes, 2nd edition boxed set is 3rd edition of the books.
by rabuf
Wed Apr 02, 2008 5:38 pm UTC
Forum: Computer Science
Topic: suggestions for computer science books
Replies: 12
Views: 2687

Re: suggestions for computer science books

Volume 1 Fascicle 1 (2005) is an update to a part of Volume 1 of TAoCP. In the book, Knuth created and used a machine called MIX, which he came up with several decades ago. MMIX is a more modern architecture and assembly language. What you will want though are the 3rd editions of the books.
by rabuf
Thu Mar 20, 2008 2:32 pm UTC
Forum: Logic Puzzles
Topic: Buffalo buffalo buffalo.
Replies: 58
Views: 24019

Re: Buffalo buffalo buffalo.

I'm surprised no one has posted this one yet:
Make make.
Make make make make.
Make make make make make make...

Go to advanced search