Wolfram Demonstrations

Conceived by Mathematica creator and scientist Stephen Wolfram as a way to bring computational exploration to the widest possible audience, the Wolfram Demonstrations Project is an open-code resource that uses dynamic computation to illuminate concepts in science, technology, mathematics, art, finance, and a remarkable range of other fields. Its daily growing collection of interactive illustrations is created by Mathematica users from around the world who participate by contributing innovative Demonstrations. Interactive computational resources have typically been scattered across the web. Moreover, their creation requires specialized programming knowledge, making them difficult and expensive to develop. As a result, their breadth and reach are limited. With its debut in 2007, the Wolfram Demonstrations Project introduced a new paradigm for exploring ideas, providing a universal platform for interactive electronic publishing. The power to easily create interactive visualizations, once the province of computing experts alone, is now in the hands of every Mathematica user. More importantly, anyone around the world can freely use these thousands of fully functional Demonstrations. From elementary education to front-line research, topics span an ever-growing array of categories. Some Demonstrations can be used to enliven a classroom or visualize complex concepts, while others shed new light on cutting-edge ideas from academic and industrial workgroups. Each is reviewed and edited by experts for content, clarity, presentation, quality, and reliability.

References in zbMATH (referenced in 15 articles )

Showing results 1 to 15 of 15.
Sorted by year (citations)

  1. Ardentov, Andrey A.: Controlling of a mobile robot with a trailer and its nilpotent approximation (2016)
  2. Bolognesi, Tommaso; Lamb, Alexander: Simple indicators for Lorentzian causets (2016)
  3. Girard, Didier A.: Asymptotic near-efficiency of the “Gibbs-energy and empirical-variance” estimating functions for fitting Matérn models. I: Densely sampled processes (2016)
  4. Joosten, Joost J.; Soler-Toscano, Fernando; Zenil, Hector: Fractal dimension versus process complexity (2016)
  5. Elgersma, Michael; Wagon, Stan: Closing a Platonic gap (2015)
  6. Khan, Majid; Shah, Tariq: A construction of novel chaos base nonlinear component of block cipher (2014)
  7. Tomkowicz, Grzegorz; Wagon, Stan: Visualizing paradoxical sets (2014)
  8. Moya-Sánchez, E.U.; Bayro-Corrochano, E.: Hilbert and Riesz transforms using atomic function for quaternionic phase computation (2013)
  9. Zenil, Hector: Turing patterns with Turing machines: emergence and low-level structure formation (2013)
  10. Cabada, Alberto; Cid, José Ángel; Máquez-Villamarín, Beatriz: Computation of Green’s functions for boundary value problems with Mathematica (2012)
  11. Delahaye, Jean-Paul; Zenil, Hector: Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness (2012)
  12. De Smit, Bart; McClure, Mark; Palenstijn, Willem Jan; Wagon, Stan: Through the looking-glass, and what the quadratic camera found there (2012)
  13. Röst, Gergely: On an approximate method for the delay logistic equation (2011)
  14. Máder, Attila; Vajda, Róbert: Elementary approaches to the teaching of the combinatorial problem of rectangular islands (2010) MathEduc
  15. Wagon, Stan: Mathematics and Mathematica (2007)