TITLE

Iterated Strings and Cellular Automata

AUTHOR(S)
Andriychenko, Oleksiy; Chamberland, Marc
PUB. DATE
September 2000
SOURCE
Mathematical Intelligencer;Fall2000, Vol. 22 Issue 4, p33
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Presents an elementary proof to a mathematical problem posed by Sir Bryan Thwaites. Emphasis on binomial coefficients and cellular automata; Process of iterating a string; Generation of the Sierpinski Gasket with cellular automata.
ACCESSION #
3922560

 

Related Articles

  • Problems and Solutions.  // Mathematical Spectrum;2014/2015, Vol. 47 Issue 2, p90 

    Students are invited to submit solutions to some or all of the problems below. The most attractive solutions received by 1st July will be published in a subsequent issue and are eligible for annual prizes. When writing to the Editorial Office, please state your full name and also the postal...

  • Largest coefficients in binomial expansions. Pahor, Milan // Australian Senior Mathematics Journal;2006, Vol. 20 Issue 1, p53 

    The article presents a closed form solution to mathematical problems involving largest coefficients in binomial expansions. Limitations to the described mathematical solution are pointed out. It is noted that a critical feature of the solution is that the coefficients rise and then fall in a...

  • The Alternative Bernoulli Trials. Glaister, Elizabeth M.; Glaister, Paul // Mathematics in School;Sep2013, Vol. 42 Issue 4, p31 

    The article focuses on the alternative meanings of Bernoulli trial, an experiment of which outcome is random and can be of either success or failure. It discusses the mathematical jumping game, wherein, the solution to the problem is found from the sum of an infinite geometric series. It...

  • VISUALIZING VANDERMONDE'S CONVOLUTION ON THE EXTENDED PASCAL'S TRIANGLE. Chandrupatla, Tirupathi R.; Osler, Thomas J. // Mathematics & Computer Education;Spring2008, Vol. 42 Issue 2, p118 

    The article discusses a method of visualizing Vandermonde's convolution, also known as the Chu-Vandermonde convolution, on the extended Pascal's triangle. The binomial coefficient represents the number of different combinations of n distinct objects taken k at a time without repetition. The...

  • An Exact and Optimal Local Solution to the Two-Dimensional Convex Hull of Arbitrary Points Problem. TORBEY, SAMI; AKL, SELIM G. // Journal of Cellular Automata;2009, Vol. 4 Issue 2, p137 

    A solution to the convex hull problem can be very difficult to achieve using cellular automata, where the input points cannot directly communicate with each other. Previous solutions have been limited to the case where all input points are adjacent in discrete space (they form one non-convex...

  • Cellular Automata with Memory and the Density Classification Task. ALONSO-SANZ, RAMON // Journal of Cellular Automata;2013, Vol. 8 Issue 3/4, p283 

    The effectiveness of memory of delay type in solving the density classification task in cellular automata is assessed in this study.

  • Why Do We Believe Theorems?†. PELC, ANDRZEJ // Philosophia Mathematica;Feb2009, Vol. 17 Issue 1, p84 

    The formalist point of view maintains that formal derivations underlying proofs, although usually not carried out in practice, contribute to the confidence in mathematical theorems. Opposing this opinion, the main claim of the present paper is that such a gain of confidence obtained from any...

  • Problem Solving as a Precursor to Mathematical Proof. Sriraman, Bharath // Mathematics in School;Jan2005, Vol. 34 Issue 1, p4 

    Discusses the use of problem solving in teaching mathematical proof. Debate regarding the introduction and teaching of mathematical proof to students; Information on the inductive-interpretive approach; Details of the inductive-deductive approach.

  • Algorithmic Scientific Inference. CASE, JOHN // International Journal of Unconventional Computing;2012, Vol. 8 Issue 3, p193 

    It is argued that, scientific laws, including quantum mechanical ones, can be considered algorithmic, that the expected behavior of the world, if not its exact behavior, is algorithmic, that, then, communities of human scientists over time have algorithmic expected behavior. Some sample theorems...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics