I'm getting back into grad school, at the tender age of 68, and am
loving it! The class I'm taking is pretty tough, CS500 .. based on
the upcoming book, The Nature of Computation by Moore and Mertens
(Cris Moore is teaching the class I'm taking).
http://www.nature-of-computation.org/
I've started in on LaTeX, really nice. Now its time to get into
Sage. Naturally its computation power is great: linear algebra,
Fibonacci and other series, graph theory etc. Great for answers to
mathematical questions.
But the class is less oriented towards answers to questions than it is
towards proofs, demonstrations, pseudocode of problems and so on.
Python qualifies for pseudocode .. easily morphed into whatever
pseudocode the LaTeX package uses.
So the sort of things I'd like to do with Sage is
- Create a graph and write code to explore it.
- Work with regular expression proofs (find/test equivalence classes)
- Solve recurrence equations for finding asymptotic bounds for
algorithms.
- Test proofs that I think/hope are right, procedures polynomial in
time.
I know Sage is useful for theoretical computer science and wonder if
you could give me some pointers and tips. How to use python within
sage on graphs, for example. Or reduce recurrence/difference
equations. Basically, how Sage is used by the theoretical computer
science community.
Thanks!
-- Owen
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/sage-support
URL: http://www.sagemath.org
