-
Here is an example from the french sagebook to compute the laplacian in polar, that no longer works with version 4.6 of Sage
```
sage: x, y, r, t = var('x, y, r, t'); f = function('f', x, y)
sage: …
-
- [x] 1 - Alphabetize items
- [ ] 2 - List price for each resource (including "free")
- [x] 3 - Add Table of Contents
4mber updated
5 months ago
-
-
While reading https://hbr.github.io/Lambda-Calculus/cc-tex/cc.pdf I found some typos:
Page 4: Carring out computations
Carrying
Page 7: based to some extend
extent
Page 6,9,...,105 wellfor…
-
[Coq Library of Undecidability Proofs](https://github.com/uds-psl/coq-library-undecidability) is a collection of definitions and results related to computability, not least the halting problem. For ex…
-
When a symbol returned by `SR.symbol()` is passed through Maxima, it is turned into another symbol. They compare equal (because comparison invokes Maxima, probably) but they are not the same object.…
-
-
In order to prove out the ability to use government units for department borders, we need to determine the fit of existing government units to known-good (eg. verified boundaries).
IPython notebook…
-
*Issue migrated from trac ticket # 751*
**component:** General | **priority:** minor
#### 2010-06-29 10:19:08: scranen@win.tue.nl created the issue
___
'nuff said, probably. Simple include functio…
-
Currently the parsers will only create an unstructured string to describe a course's prereqs, coreqs and cross-listed courses. If we can somehow turn this into a more usable data structure we can gain…
ghost updated
2 years ago