Topics Top articles New articles Updated articles Top users New users New discussions Top discussions New comments+ New article
Atomic bombings of Hiroshima and Nagasaki by 
Ciro Santilli 34 Updated 2024-12-15 +Created 1970-01-01
Ciro Santilli 34 Updated 2024-12-15 +Created 1970-01-01
In the case of the Schrödinger equation solution for the hydrogen atom, each orbital is one eigenvector of the solution.
Remember from time-independent Schrödinger equation that the final solution is just the weighted sum of the eigenvector decomposition of the initial state, analogously to solving partial differential equations with the Fourier series.
This is the table that you should have in mind to visualize them: en.wikipedia.org/w/index.php?title=Atomic_orbital&oldid=1022865014#Orbitals_table
Boring rule that says that less energetic atomic orbitals are filled first.
Much more interesting is actually determining that order, which the Madelung energy ordering rule is a reasonable approximation to.
There are two types of people:
- those who are autodidacts
- those who didn't really learn
Some possible definitions:
- learning without a gun pointed at your head
- learning from an e-book or video rather than from a talking head 5 rows of chairs in front of youHow that is different from a video, you tell me.
Thus OurBigBook.com.
Automated theorem proving by halting problem reduction by Ciro Santilli 34 Updated 2024-12-15 +Created 1970-01-01
Ciro Santilli 34 Updated 2024-12-15 +Created 1970-01-01If you can reduce a mathematical problem to the Halting problem of a specific turing machine, as in the case of a few machines of the Busy beaver scale, then using Turing machine deciders could serve as a method of automated theorem proving.
That feels like it could be an elegant proof method, as you reduce your problem to one of the most well studied representations that exists: a Turing machine.
However it also appears that certain problems cannot be reduced to a halting problem... OMG life sucks (or is awesome?): Section "Turing machine that halts if and only if Collatz conjecture is false".
Autonomous agents research group of the University of Edinburgh by Ciro Santilli 34 Updated 2024-12-15 +Created 1970-01-01
Ciro Santilli 34 Updated 2024-12-15 +Created 1970-01-01Some criticisms:
Average length of a Snakes and Ladders game by Ciro Santilli 34 Updated 2024-12-15 +Created 1970-01-01
Ciro Santilli 34 Updated 2024-12-15 +Created 1970-01-01Since Snakes and Ladders is nothing but a Absorbing Markov chain, the results are exactly the same as for that general problem.
www.jstor.org/stable/3619261: How Long Is a Game of Snakes and Ladders? by Althoen, King and Schilling (1993), paywalled.
Average number of steps spent on a node of a Markov chain by Ciro Santilli 34 Updated 2024-12-15 +Created 1970-01-01
Ciro Santilli 34 Updated 2024-12-15 +Created 1970-01-01TODO how to calculate
Average number of steps until reaching a state of a Markov chain by Ciro Santilli 34 Updated 2024-12-15 +Created 1970-01-01
Ciro Santilli 34 Updated 2024-12-15 +Created 1970-01-01TODO how to calculate
Largest programs ever written:
Pinned article: ourbigbook/introduction-to-the-ourbigbook-project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivative - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.
Figure 3. Visual Studio Code extension installation.
Figure 4. Visual Studio Code extension tree navigation.
Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.Video 4. OurBigBook Visual Studio Code extension editing and navigation demo. Source. - Internal cross file references done right:
- Infinitely deep tables of contents:
Figure 6. Dynamic article tree with infinitely deep table of contents.Live URL: ourbigbook.com/cirosantilli/chordateDescendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact