The opposite of volatile memory.
Computational problem where the solution is either yes or no.
When there are more than two possible answers, it is called a function problem.
Decision problems come up often in computer science because many important problems are often stated in terms of "decide if a given string belongs to given formal language".
A problem that has more than two possible yes/no outputs.
The ultimate high level of which is of course to program with:which is basically the goal of artificial general intelligence, especially according to The Employment Test definition of AGI.
The term has not always had that sense:sums it up.
automatic programming has always been a euphemism for programming in a higher-level language than was then available to the programmer
Reproducible builds allow anyone to verify that a binary large object contains what it claims to contain!
In the classification of finite simple groups, groups of Lie type are a set of infinite families of simple lie groups. These are the other infinite families besides te cyclic groups and alternating groups.
A decent list at: en.wikipedia.org/wiki/List_of_finite_simple_groups, en.wikipedia.org/wiki/Group_of_Lie_type is just too unclear. The groups of Lie type can be subdivided into:
- Chevalley groups
- TODO the rest
The first in this family discovered were a subset of the Chevalley groups by Galois: , so it might be a good first one to try and understand what it looks like.
TODO understand intuitively why they are called of Lie type. Their names , seem to correspond to the members of the classification of simple Lie groups which are also named like that.
But they are of course related to Lie groups, and as suggested at Video "Yang-Mills 1 by David Metzler (2011)" part 2, the continuity actually simplifies things.
There are unlisted articles, also show them or only show them.