Search Results for ""
12811 - 12820 of 13135 for bookSearch Results
Integrals over the unit square arising in geometric probability are int_0^1int_0^1sqrt(x^2+y^2)dxdy=1/3[sqrt(2)+sinh^(-1)(1)] int_0^1int_0^1sqrt((x-1/2)^2+(y-1/2)^2)dxdy ...
A universal cellular automaton is a cellular automaton which, like a Turing machine, exhibits universality. von Neumann proved that an automaton consisting of cells with four ...
A Turing machine which, by appropriate programming using a finite length of input tape, can act as any Turing machine whatsoever. In his seminal paper, Turing himself gave ...
There are many unsolved problems in mathematics. Some prominent outstanding unsolved problems (as well as some which are not necessarily so well known) include 1. The ...
A vertex-transitive graph, also sometimes called a node symmetric graph (Chiang and Chen 1995), is a graph such that every pair of vertices is equivalent under some element ...
The partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to ...
Watson (1939) considered the following three triple integrals, I_1 = 1/(pi^3)int_0^piint_0^piint_0^pi(dudvdw)/(1-cosucosvcosw) (1) = (4[K(1/2sqrt(2))]^2)/(pi^2) (2) = ...
Wavelets are a class of a functions used to localize a given function in both space and scaling. A family of wavelets can be constructed from a function psi(x), sometimes ...
A regular graph that is not strongly regular is known as a weakly regular graph. There are no weakly regular simple graphs on fewer than six nodes, and the numbers on n=6, 7, ...
The Wells graph, sometimes also called the Armanios-Wells graph, is a quintic graph on 32 nodes and 80 edges that is the unique distance-regular graph with intersection array ...
...
View search results from all Wolfram sites (169407 matches)

