183 reputation
8
bio website naesten.blogspot.com
location Pennsylvania
age 28
visits member for 4 years, 2 months
seen May 9 at 4:44

I am fascinated by computers, and have been since before I could read. My favorite programming languages are Haskell and Python, and I'm no stranger to C.

My childhood was spent on DOS and Windows 95. After learning to read, I managed to learn the basics of programming with the help of The Secret Guide to Computers, GWBASIC, UCBLogo, LADYBUG Logo, and some LOGO book(s) I can't recall the names of. I didn't much like GWBASIC, but at least it had a printed reference manual. I had also tried QBASIC, but had trouble with the online help, which I later decided was probably because all of the text was in the same font (making it hard to tell the verbatim code from the other notation).

[... Windows, VB, DJGPP, Cygwin, Mindstorms, POV-RAY ...]

Eventually I bought my own computer and installed a copy of Linux, and that's when I really began to learn how computer systems work: technical documentation for most things was available online, and if that wasn't enough to satisfy my curiosity I could look at the source code.

[... Python ... Haskell ...]


Jan
11
revised Help with differentiation from first principles
Fix formatting and spelling
Jan
11
suggested approved edit on Help with differentiation from first principles
Jan
11
revised Simple vector addition problem
formatting + tags
Jan
11
suggested approved edit on Simple vector addition problem
Jan
11
awarded  Organizer
Jan
11
revised Condition for this set of points
Fix spelling, grammar, formatting
Jan
11
suggested approved edit on Condition for this set of points
Jan
11
comment Why are mathematical proofs that rely on computers controversial?
@JacobWakem: Proofs have always needed rechecking; this is not introduced by the use of computers.
Jan
10
awarded  Teacher
Jan
10
answered Why are mathematical proofs that rely on computers controversial?
Nov
27
awarded  Informed
Mar
5
awarded  Excavator
Mar
5
revised True?: Let $(n, m)$ be an arbitrary Amicable Pair. Then $n$ is odd iff its last digit is $5$
math formatting
Mar
5
suggested approved edit on True?: Let $(n, m)$ be an arbitrary Amicable Pair. Then $n$ is odd iff its last digit is $5$
Mar
5
revised Amicable Pair $(a, b)$: given $a$, what are limits on size of $b$?
math formatting
Mar
5
suggested approved edit on Amicable Pair $(a, b)$: given $a$, what are limits on size of $b$?
Mar
5
comment What does it mean for a polynomial with integer coefficients to have a root in $p$-adic integers?
@J.D.: Well, mostly because I keep spotting titles that could use formatting...
Mar
5
suggested rejected edit on p-adic numbers and binomial coefficients
Mar
5
suggested rejected edit on Extending the p-adic valuation
Mar
5
revised Square roots in the $p$-adics
math formatting in title