Search Results for ""
431 - 440 of 710 for Chebyshev Polynomialofthe First KindSearch Results
View search results from all Wolfram sites (181114 matches)Rule 102 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...
Rule 110 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...
Rule 90 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...
An algorithm for making tables of primes. Sequentially write down the integers from 2 to the highest number n you wish to include in the table. Cross out all numbers >2 which ...
Consider the consecutive number sequences formed by the concatenation of the first n positive integers: 1, 12, 123, 1234, ... (OEIS A007908; Smarandache 1993, Dumitrescu and ...
A special function is a function (usually named after an early investigator of its properties) having a particular use in mathematical physics or some other branch of ...
Stratton (1935), Chu and Stratton (1941), and Rhodes (1970) define the spheroidal functions as those solutions of the differential equation (1) that remain finite at the ...
A tag system is set of rules that specifies a fixed number of elements (commonly denoted nu or beta) be removed from the beginning of a sequence and a set of elements to be ...
A totalistic cellular automaton is a cellular automata in which the rules depend only on the total (or equivalently, the average) of the values of the cells in a ...
Turmites, also called turning machines, are 2-dimensional Turing machines in which the "tape" consists of a grid of spaces that can be written and erased by an active ...
...