Topics (206k) Articles (211k) Users (298) Discussions (237) Comments (383) Files (715) New article
There is a Turing machine that halts for every member of the language with the answer yes, but does not necessarily halt for non-members.
This is the classic result of formal language theory, but there is too much slack between context free and context sensitive, which is PSPACE (larger than NP!).
By Noam Chomsky.
A good summary table that opens up each category much more can be seen e.g. at the bottom of en.wikipedia.org/wiki/Automata_theory under the summary thingy at the bottom entitled "Automata theory: formal languages and formal grammars".
The opposite of from first principles.
There's exactly one field per prime power, so all we need to specify a field is give its order, notated e.g. as .
It is interesting to compare this result philosophically with the classification of finite groups: fields are more constrained as they have to have two operations, and this leads to a much simpler classification!
Video "Finite fields made easy by Randell Heyman (2015)" at youtu.be/z9bTzjy4SCg?t=159 shows how for order . Basically, for order , we take:For a worked out example, see: GF(4).
- each element is a polynomial in , , the polynomial ring over the finite field with degree smaller than . We've just seen how to construct for prime above, so we're good there.
- addition works element-wise modulo on
- multiplication is done modulo an irreducible polynomial of order
Ciro Santilli tried to add this example to Wikipedia, but it was reverted, so here we are, see also: Section "Deletionism on Wikipedia".
This is a good first example of a field of a finite field of non-prime order, this one is a prime power order instead.
, so one way to represent the elements of the field will be the to use the 4 polynomials of degree 1 over GF(2):
Note that we refer in this definition to anther field, but that is fine, because we only refer to fields of prime order such as GF(2), because we are dealing with prime powers only. And we have already defined fields of prime order easily previously with modular arithmetic.
Without modulo, that would not be one of the elements of the field anymore due to the !
So we take the modulo, we note that:and by the definition of modulo:which is the final result of the multiplication.
The most powerful GUI file manager ever?? Infinite configurability??
Ciro Santilli wasted some time on it before he gave up on file managers altogether and started using only the CLI with a few aliases.
Ciro Santilli considered it before he stopped using file managers altogether, it is not bad.
GitHub account: github.com/hplgit
It should be mentioned that when you start Googling for PDE stuff, you will reach Han's writings a lot under his GitHub Pages: hplgit.github.io/, and he is one of the main authors of the FEniCS Project.
He also published to GitHub pages with his own crazy markdown-like multi-output markup language: github.com/hplgit/doconce.
Rest in peace, Hans.
Pinned article: 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!
Intro to OurBigBook
. Source. 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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 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. 
- Infinitely deep tables of contents:
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