User Portlet
Featured Contributor
| Discussions |
|---|
| ADDENDUM: In NKS terms, what the basis/target machinery changes is this: it takes two of Wolfram's central qualitative moves; behavioral classification by inspection, and the observer-dependence of complexity and turns them into linear algebra... |
| Hi Daniel, I finally decided to go with this paper: Arne Storjohann. 1998. An O(n3) algorithm for the Frobenius normal form. In Proceedings of the 1998 international symposium on Symbolic and algebraic computation (ISSAC '98). Association for... |
| Congratulations on the Staff Pick and the Featured Contributor badge, Ramón! It is incredibly rewarding to see you build upon the algebraic framework and take it in such exciting new directions. Thank you for sharing this with the community |
| &[Wolfram Notebook][1] [1]: https://www.wolframcloud.com/obj/c4a1ef8d-8d48-4bf8-abe0-0eac4501058d |
| &[Wolfram Notebook][1] [1]: https://www.wolframcloud.com/obj/1f196033-714a-413f-90e4-7b22075ea1f4 |
| Rule 30 exact binomial-Lucas lifting: boolean logic to integer coefficients, Stirling & support sets https://mathematica.stackexchange.com/questions/318912/rule-30-finding-a-closed-formula-for-the-s-m-subset-recurrence/319098#319098 |
| &[Wolfram Notebook][1] [1]: https://www.wolframcloud.com/obj/3fa8d946-5a42-43e9-be49-7bdea1ec9e63 |
| Hi David, thanks for the reply! Good luck with your Rule 30 work, it’s definitely a deep and fascinating problem. I’m also not entirely sure about the current status of the prize, which is part of why I asked. I’d be happy to chat and exchange... |
| Hi everyone, My name is Tigran. I am working with the Wolfram Language on cellular automata and would like to ask whether a particular larger-neighborhood extension of Rule 110, defined in algebraic normal form (ANF) over GF(2), is already known,... |