598 reputation
510
bio website
location Waterloo, Canada
age 20
visits member for 2 years, 6 months
seen Nov 25 '13 at 22:58

A study at University of Waterloo. Studying in a hybrid program, partly is Computer Science.


Oct
19
awarded  Yearling
Oct
19
awarded  Yearling
Aug
2
awarded  Good Question
Mar
20
awarded  Notable Question
Mar
9
awarded  Editor
Mar
9
revised Why is Scheme my first language in university?
added 416 characters in body
Dec
30
awarded  Teacher
Dec
1
comment Process arbitrarily large lists without explicit recursion or abstract list functions?
Hi this course just ended today. It turns out that the last module is the CS history, from Charles Babbage all the way to the post Turing era. My prof illustrated the changes along the way. As for lambda calculus, we saw how to construct 0, 1, 2, etc, and were told that general recursive is hard but still possible. I guess this is their initial intention: to let us think this was hard or even impossible, and when our curiosity is ready, learning this history is more fun. I really enjoyed today's lecture!!!
Nov
27
comment Process arbitrarily large lists without explicit recursion or abstract list functions?
I think the profs don't want us to "come up with" the solution but only to put some thoughts into it. For example I would not have known the name "lambda calculus" if there were not a question like this.
Nov
27
comment Process arbitrarily large lists without explicit recursion or abstract list functions?
The requirements are quoted here: "(c) For the ultimate challenge, write the Scheme function subsets3. As always, the func- tion produces the list of subsets of an input list of numbers. Do not write any helper functions, and do not use any explicit recursion (i.e., your function cannot call itself by name). Do not use any abstract list functions. In fact, use only the following list of Scheme functions, constants and special forms: cons, first, rest, empty?, empty, lambda, and cond. You are permitted to use define exactly once, to define the function itself. (Value: 5%)"
Nov
27
accepted Process arbitrarily large lists without explicit recursion or abstract list functions?
Nov
27
comment Process arbitrarily large lists without explicit recursion or abstract list functions?
Sorry we haven't studied lambda calculus yet. But wow, this is very eye-opening!
Nov
26
comment Process arbitrarily large lists without explicit recursion or abstract list functions?
Yes, it is the ultimate challenge among the bonuses. Easier ones allow recursion or abstract list functions.
Nov
26
asked Process arbitrarily large lists without explicit recursion or abstract list functions?
Nov
12
comment Is it wise to ask about design decisions made on a product during an interview?
How to find companies like yours... Or is it just luck?
Nov
9
awarded  Popular Question
Nov
1
answered How to trim emails for just the body, when using email as input to an external system?
Nov
1
comment How to trim emails for just the body, when using email as input to an external system?
But two hyphens don't always mean that, e.g. when the sender want to split something but the second half end up cut out. That hurts...
Oct
27
comment Should I get a Math bachelors and then go into Computer Science?
Yes. Logic is what you get... But you shall know something about CS before you apply, I assume. You cannot just go into a CS graduate school without writing some codes.
Oct
27
comment What can I do to keep my skills sharp without the internet?
Thanks for such a nice site!