<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="https://community.wolfram.com">
    <title>Community RSS Feed</title>
    <link>https://community.wolfram.com</link>
    <description>RSS Feed for Wolfram Community showing any discussions tagged with Biological Sciences sorted by active.</description>
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3713047" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3675919" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/122095" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3674011" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3671124" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3649858" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3642486" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3642762" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3641221" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3638608" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3637839" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3607816" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3607149" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3606767" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3597063" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3597072" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3586632" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3585501" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3582366" />
        <rdf:li rdf:resource="https://community.wolfram.com/groups/-/m/t/3574743" />
      </rdf:Seq>
    </items>
  </channel>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3713047">
    <title>Red hair tips electric eel in fast and slow motion: translating from P5.JS processing to Wolfram</title>
    <link>https://community.wolfram.com/groups/-/m/t/3713047</link>
    <description>![Red hair tips electric eel in fast and slow motion: translating from P5.JS processing to Wolfram][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=ezgif-20001a6ec98fb594.gif&amp;amp;userId=11733&#xD;
  [2]: https://www.wolframcloud.com/obj/78388bcc-f070-44d3-9035-26433cf1ce85</description>
    <dc:creator>Vitaliy Kaurov</dc:creator>
    <dc:date>2026-05-08T02:51:54Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3675919">
    <title>Constraint vs search: why is evolution computationally tractable?</title>
    <link>https://community.wolfram.com/groups/-/m/t/3675919</link>
    <description>**Intro**&#xD;
&#xD;
A fundamental question keeps coming up for me:&#xD;
If biological evolution operates in astronomically large spaces, why is search computationally tractable at all?&#xD;
Even a modest protein corresponds to a combinatorial space that is effectively impossible to exhaustively explore. Yet evolution does not behave like an unconstrained random search.&#xD;
So what makes the space navigable?&#xD;
&#xD;
**Essay**&#xD;
&#xD;
In 1859, two different perspectives on complexity emerged.  &#xD;
Bernhard Riemann revealed deep structural order underlying the distribution of prime numbers.&#xD;
Charles Darwin introduced a dynamical process of variation and selection.  &#xD;
Modern biology has successfully developed Darwin’s framework. However, something is often left implicit: the assumption that the search space is already structured in a way that makes local exploration effective.  &#xD;
From a purely combinatorial perspective, this is problematic. Under simple assumptions (independent variation, no bias), expected search time grows exponentially with the amount of required information. In that regime, evolution would be computationally intractable.&#xD;
But real systems do not operate in that regime.  &#xD;
Instead, they appear to evolve within a highly structured, constrained subspace, where:  &#xD;
functional states are not isolated  &#xD;
viable configurations form connected regions  &#xD;
local mutations can traverse meaningful paths  &#xD;
This suggests that evolution can be framed as a constrained search problem, rather than a purely stochastic process.  &#xD;
Evolution is not merely a process acting within a space &amp;#x2014; it is a process shaped by the structure of the space it can access.  &#xD;
This shifts the central question:  &#xD;
What determines that accessible space?  &#xD;
&#xD;
**A Minimal Computational Model**&#xD;
&#xD;
To make this concrete, consider a simple toy model.  &#xD;
We define:  &#xD;
a sequence space  &#xD;
a mutation operator  &#xD;
a constraint that restricts transitions&#xD;
&#xD;
**Basic setup**&#xD;
&#xD;
    L = 20;&#xD;
    randomSeq[] := RandomInteger[{0, 1}, L];    &#xD;
    mutate[s_] := ReplacePart[s, RandomInteger[{1, L}] -&amp;gt; 1 - #] &amp;amp; @ s;&#xD;
&#xD;
&#xD;
&#xD;
**Fitness function**&#xD;
&#xD;
    fitness[s_] := Boole[Total[s] &amp;gt; 12];&#xD;
&#xD;
&#xD;
**Constraint energy**&#xD;
&#xD;
    energy[s_] := Total[&#xD;
      Map[If[# === {1, 1}, 0, 1] &amp;amp;, Partition[s, 2, 1]]&#xD;
    ];&#xD;
&#xD;
&#xD;
**Dynamics: constrained vs unconstrained**&#xD;
&#xD;
    stepConstrained[s_] := Module[{s2 = mutate[s]},&#xD;
      If[constraint[s, s2], s2, s]&#xD;
    ];&#xD;
    &#xD;
    stepRandom[s_] := mutate[s];&#xD;
&#xD;
**Search experiment**&#xD;
&#xD;
    findFunctional[step_, max_] := Module[&#xD;
      {s = randomSeq[], t = 0},&#xD;
      &#xD;
      While[t &amp;lt; max &amp;amp;&amp;amp; !TrueQ[fitness[s] == 1],&#xD;
        s = step[s];&#xD;
        t++;&#xD;
      ];&#xD;
      &#xD;
      t&#xD;
    ];&#xD;
    &#xD;
    trialsConstrained = Table[&#xD;
      findFunctional[stepConstrained, 1000],&#xD;
      {50}&#xD;
    ];&#xD;
    &#xD;
    trialsRandom = Table[&#xD;
      findFunctional[stepRandom, 1000],&#xD;
      {50}&#xD;
    ];&#xD;
&#xD;
**Visualization**&#xD;
&#xD;
    Histogram[&#xD;
      {trialsRandom, trialsConstrained},&#xD;
      ChartLegends -&amp;gt; {&amp;#034;Random&amp;#034;, &amp;#034;Constrained&amp;#034;},&#xD;
      PlotTheme -&amp;gt; &amp;#034;Scientific&amp;#034;,&#xD;
      Frame -&amp;gt; True&#xD;
    ]&#xD;
&#xD;
**Interpretation**&#xD;
&#xD;
In many runs, the constrained dynamics reaches functional states faster &amp;#x2014; not because the system is explicitly guided toward a target, but because the structure of the space itself has changed.  &#xD;
Even in this minimal model, a key effect emerges:  &#xD;
Pure random mutation behaves like unstructured search  &#xD;
Even a simple constraint dramatically reshapes accessibility  &#xD;
The constraint does not “guide” the system toward solutions. Instead, it reshapes the space such that functional paths become possible in the first place.&#xD;
&#xD;
**Open Questions**&#xD;
&#xD;
This raises several structural questions:&#xD;
&#xD;
- How can we formally define a constraint operator in general systems?  &#xD;
- Can constraint-induced subspaces be measured or classified?  &#xD;
- How does connectivity emerge in high-dimensional spaces under constraints?  &#xD;
- Do constrained systems exhibit characteristic spectral signatures (e.g., non-random eigenvalue statistics)?&#xD;
&#xD;
**Closing Thought**&#xD;
&#xD;
The difference between intractable search and effective evolution may not lie in time or randomness &amp;#x2014; but in the geometry of the accessible space itself.</description>
    <dc:creator>Maurice Crutzen</dc:creator>
    <dc:date>2026-04-07T09:31:01Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/122095">
    <title>Dancing with friends and enemies: boids&amp;#039; swarm intelligence</title>
    <link>https://community.wolfram.com/groups/-/m/t/122095</link>
    <description>The latest way I have found to use my expensive math software for frivolous entertainment is this. Here&amp;#039;s is a way to describe it. 
[list]
[*]1000 dancers assume random positions on the dance-floor. 
[*]Each randomly chooses one &amp;#034;friend&amp;#034; and one &amp;#034;enemy&amp;#034;. 
[*]At each step every dancer 
[list]
[*]moves 0.5% closer to the centre of the floor
[*]then takes a large step towards their friend 
[*]and a small step away from their enemy. 
[/list]
[*]At random intervals one dancer re-chooses their friend and enemy
[/list]
Randomness is deliberately injected. Here is the dance...
[mcode]n = 1000; 
r := RandomInteger[{1, n}]; 
f := (#/(.01 + Sqrt[#.#])) &amp;amp; /@ (x[[#]] - x) &amp;amp;; 
s := With[{r1 = r}, p[[r1]] = r; q[[r1]] = r]; 
x = RandomReal[{-1, 1}, {n, 2}]; 
{p, q} = RandomInteger[{1, n}, {2, n}]; 
Graphics[{PointSize[0.007], Dynamic[If[r &amp;lt; 100, s]; 
Point[x = 0.995 x + 0.02 f[p] - 0.01 f[q]]]}, PlotRange -&amp;gt; 2][/mcode]
[img]/c/portal/getImageAttachment?filename=OPTfnlfrnds.gif&amp;amp;userId=11733[/img]

Thanks to Vitaliy for posting this on my behalf, complete with animations :-)

Background: I had read somewhere that  macro-scale behaviour of animal swarms (think of flocks of starlings or shoals of herring) is explained by each individual following very simple rules local to their vicinity, essentially 1) try to keep up and 2) try not to collide. I started trying to play with this idea in Mathematica, but it was rather slow to identify the nearest neighbours of each particle. So I wondered what would happen if each particle acted according to the locations of two other particles, regardless of their proximity. The rule was simply to move away from one and towards the other.

The contraction (x = 0.995 x) was added to prevent the particle cloud from dispersing towards infinity or drifting away from the origin. I tweaked the &amp;#034;towards&amp;#034; and &amp;#034;away&amp;#034; step sizes to strike a balance between the tendency to clump together and to spread apart (if you make the step sizes equal you get something more like a swarm of flies). With each particle&amp;#039;s attractor and repeller fixed, the system finds a sort of dynamic equilibrium, so to keep things changing I added a rule to periodically change the attractor and repeller for one of the particles. The final adjustment was to make the &amp;#034;force&amp;#034; drop towards zero for particles at very close range. This helps to stop the formation of very tight clumps, and also prevents a division-by-zero error when a particle chooses itself as its attractor or repeller.

The description of the system as a dance was an attempt to explain the swirling pattern on the screen without using mathematical language. I&amp;#039;d love to see what other &amp;#034;dances&amp;#034; can be created with other simple rules.</description>
    <dc:creator>Simon Woods</dc:creator>
    <dc:date>2013-09-11T18:31:12Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3674011">
    <title>The genetic code as geometry on Q_6: hidden mathematical structure in the codon hypercube</title>
    <link>https://community.wolfram.com/groups/-/m/t/3674011</link>
    <description>The Genetic Code as Geometry on Q_6: Hidden Mathematical Structure in the Codon Hypercube&#xD;
S.H. Bachani, Merlin Digital, Dubai, UAE  &#xD;
April 2026  &#xD;
**Abstract**  &#xD;
This computational exploration demonstrates how the 64 genetic codons, naturally embedded on a 6-dimensional hypercube (Q_6), reveal unexpected physical structure when annotated with ab initio quantum chemistry data. By analyzing the graph Laplacian of formation and solvation energies, we show that clinical pathogenicity in genetic mutations can be predicted from first principles without machine learning.  &#xD;
1. The Codon Hypercube  &#xD;
Every codon consists of three nucleotide positions drawn from \{U, C, A, G\}. By encoding these as 2-bit values (U=00, C=01, A=10, G=11), each codon becomes a 6-bit binary string. Consequently, the 64 codons naturally occupy the vertices of Q_6, the 6-dimensional hypercube.  &#xD;
&#xD;
    (* Nucleotide encoding *)&#xD;
    [span_7](start_span)nucBits = &amp;lt;|&amp;#034;U&amp;#034; -&amp;gt; 0, &amp;#034;C&amp;#034; -&amp;gt; 1, &amp;#034;A&amp;#034; -&amp;gt; 2, &amp;#034;G&amp;#034; -&amp;gt; 3|&amp;gt;;[span_7](end_span)&#xD;
    [span_8](start_span)nucFromBits = &amp;lt;|0 -&amp;gt; &amp;#034;U&amp;#034;, 1 -&amp;gt; &amp;#034;C&amp;#034;, 2 -&amp;gt; &amp;#034;A&amp;#034;, 3 -&amp;gt; &amp;#034;G&amp;#034;|&amp;gt;;[span_8](end_span)&#xD;
    &#xD;
    (* Codon to Q6 vertex *)&#xD;
    codonToVertex[codon_String] := &#xD;
      nucBits[StringTake[codon, {1}]] * 16 + &#xD;
      nucBits[StringTake[codon, {2}]] * 4 + &#xD;
      [span_9](start_span)nucBits[StringTake[codon, {3}]];[span_9](end_span)&#xD;
    &#xD;
    (* Q6 vertex to codon *)&#xD;
    vertexToCodon[s_Integer] := &#xD;
      nucFromBits[BitAnd[BitShiftRight[s, 4], 3]] &amp;lt;&amp;gt; &#xD;
      nucFromBits[BitAnd[BitShiftRight[s, 2], 3]] &amp;lt;&amp;gt; &#xD;
      [span_10](start_span)nucFromBits[BitAnd[s, 3]];[span_10](end_span)&#xD;
    &#xD;
    (* Construct Q6 *)&#xD;
    [span_11](start_span)Q6 = HypercubeGraph[6];[span_11](end_span)&#xD;
&#xD;
Q_6 has 64 vertices and 192 edges. Each edge connects codons that differ by a single-bit mutation&amp;#x2014;representing the minimal change at one nucleotide position.  &#xD;
2. Formation Energies and Curvature  &#xD;
Using standard HF/6-31G* values, we place formation energies (V_{ef}) at each vertex. The 64 codons partition into exactly 21 energy classes (20 amino acids + 1 stop signal).  &#xD;
To measure how a codon&amp;#039;s energy differs from its mutational neighborhood, we use the discrete Laplacian:  &#xD;
High magnitude |\nabla^2 V| indicates a codon sits at a &amp;#034;peak&amp;#034; or &amp;#034;valley&amp;#034; where mutations cause large physicochemical shifts. Low |\nabla^2 V| indicates an energy &amp;#034;plateau&amp;#034; where mutations are tolerated.  &#xD;
3. Predicting Mutation Pathogenicity  &#xD;
Analysis of 203,156 ClinVar variants reveals that the geometry of Q_6 predicts clinical outcomes:  &#xD;
 * Mean |\nabla^2 V| for Pathogenic variants: 90.7  &#xD;
 * Mean |\nabla^2 V| for Benign variants: 40.1  &#xD;
Pathogenic mutations originate preferentially from high-curvature positions on the hypercube. This physical metric is orthogonal to existing tools like AlphaMissense, capturing a different physical dimension of vulnerability.  &#xD;
4. Solvation and Multi-Landscape Analysis  &#xD;
A second landscape&amp;#x2014;solvation free energy (\Delta G_{solv})&amp;#x2014;reproduces experimental hydrophobicity (\rho = 0.810) without empirical fitting. The Laplacians of these two fields (\nabla^2 V_{ef} and \nabla^2 V_{solv}) are nearly independent (\rho = 0.167), representing distinct axes of &amp;#034;product disruption&amp;#034; and &amp;#034;folding disruption&amp;#034;.  &#xD;
5. Questions for the Community  &#xD;
 * Is the genetic code a ground state? Does the standard code minimize the &amp;#034;frustration&amp;#034; (sum of energy differences across edges) compared to random reassignments on Q_6?  &#xD;
 * Why Q_6? Is there a geometric constraint that makes 6-dimensional space optimal for encoding 21 energy classes?  &#xD;
 * Quantum Hardware: This structure maps to a 6-qubit register, currently used in topologically-constrained quantum lattice architectures (US Patent 64/027,290).  &#xD;
References  &#xD;
 * [1] Bachani, S.H. (2026). Computational framework for genomic analysis using hexagramic principles. Int. J. Phys.  &#xD;
 * [2] US Patent Application 64/027,290 (April 3, 2026).  &#xD;
 * [3] Wolfram, S. (2025). What&amp;#039;s Special about Life?</description>
    <dc:creator>Suhail Bachani</dc:creator>
    <dc:date>2026-04-03T22:12:16Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3671124">
    <title>Fireflies or nature&amp;#039;s cellular automaton</title>
    <link>https://community.wolfram.com/groups/-/m/t/3671124</link>
    <description>![Fireflies or nature&amp;#039;s cellular automaton][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=4420FirefliesorNature%27sCellularAutomaton.gif&amp;amp;userId=20103&#xD;
  [2]: https://www.wolframcloud.com/obj/abfab849-1504-446c-90d3-4a5b862ab440</description>
    <dc:creator>Kirill Vasin</dc:creator>
    <dc:date>2026-03-27T18:14:17Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3649858">
    <title>A computational approach to early breast cancer detection using Wolfram</title>
    <link>https://community.wolfram.com/groups/-/m/t/3649858</link>
    <description>![enter image description here][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=5641hero.png&amp;amp;userId=20103&#xD;
  [2]: https://www.wolframcloud.com/obj/2638b19a-4d78-495a-b65d-150df2e1923a</description>
    <dc:creator>Valerie Artavia</dc:creator>
    <dc:date>2026-03-05T20:48:58Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3642486">
    <title>Peppers and the heat of the nightshade: capsaicin chemistry, SHU scaling, and Solanaceae taxonomy</title>
    <link>https://community.wolfram.com/groups/-/m/t/3642486</link>
    <description>![Peppers and the heat of the nightshade: capsaicin chemistry, SHU scaling, and Solanaceae taxonomy][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=Peppersandtheheatofthenightshade.png&amp;amp;userId=20103&#xD;
  [2]: https://www.wolframcloud.com/obj/718eded5-aa17-4dd5-8df7-eea1622b7a7b</description>
    <dc:creator>Gay Wilson</dc:creator>
    <dc:date>2026-02-20T22:16:01Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3642762">
    <title>[WSRP25] Modeling ocean plastics and microplastic bioaccumulation in marine food webs</title>
    <link>https://community.wolfram.com/groups/-/m/t/3642762</link>
    <description>![Modeling Ocean Plastics and Microplastic Bioaccumulation in Marine Food Webs][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=7196image.png&amp;amp;userId=911151&#xD;
  [2]: https://www.wolframcloud.com/obj/29d1e66c-401f-4cd2-baeb-77c298c257af</description>
    <dc:creator>Wolfram Education Programs</dc:creator>
    <dc:date>2026-02-20T18:45:33Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3641221">
    <title>[WELP25] Modeling below-the-knee prosthetics using FEM and SLIP dynamics</title>
    <link>https://community.wolfram.com/groups/-/m/t/3641221</link>
    <description>![Modeling Below-the-Knee Prosthetics using FEM and SLIP Dynamics][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=5977image.png&amp;amp;userId=911151&#xD;
  [2]: https://www.wolframcloud.com/obj/d0eba471-b424-4c38-a404-ed4e94a5dd7b</description>
    <dc:creator>Wolfram Education Programs</dc:creator>
    <dc:date>2026-02-17T15:45:48Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3638608">
    <title>[WELP25] Evolving cellular automata megafauna through point mutations</title>
    <link>https://community.wolfram.com/groups/-/m/t/3638608</link>
    <description>![Evolving cellular automata megafauna through point mutations][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=5789image.png&amp;amp;userId=20103&#xD;
  [2]: https://www.wolframcloud.com/obj/bd64452d-92b7-4317-a7fd-bb2ee51d9590</description>
    <dc:creator>Wolfram Education Programs</dc:creator>
    <dc:date>2026-02-11T16:27:56Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3637839">
    <title>Jellyfish duo kinetic art: advanced spatiotemporal design at tiny algorithm length</title>
    <link>https://community.wolfram.com/groups/-/m/t/3637839</link>
    <description>![enter image description here][1]&#xD;
&#xD;
## Original ideas:&#xD;
&#xD;
 - ART: https://x.com/yuruyurau/status/2017968467186799048 &#xD;
 - ARTIST: https://x.com/yuruyurau  &#xD;
&#xD;
## Art, perception, computation   &#xD;
&#xD;
New kinetic art. Rich motion via tiny math. Compression is an aspect of art. Mind connects the dots without lines; and also in time - beyond space. Artist&amp;#039;s design is spatiotemporal - the dynamics is Intricate - time are space pattern are entangled. High visual complexity from a very short code.&#xD;
&#xD;
OLD QUESTION: How does the mind make a creature from dots?&#xD;
&#xD;
Enactivism says perception is something you do, not something that happens to you. 4E cognition puts that into four plain ideas: your mind is embodied in a body, embedded in a situation, enacted through action and perception, and can extend into tools, like a screen. This animation shows it cleanly. The code does not contain a “creature” as an object. Your visual system builds one by tracking coherent motion, binding thousands of dots into one moving agent, and using your expectations about how living things move to keep that agent stable from moment to moment. The “life” you feel is the mind doing its job: turning raw motion into a usable world.&#xD;
&#xD;
## Original p5.JS Processing code:&#xD;
&#xD;
&amp;gt; a=(y=i/790,d=mag(k=(y&amp;lt;8?9+sin(y^9)*6:4+cos(y))*cos(i+t/4),e=y/3-13)+cos(e+t*2+i%2*4))=&amp;gt;point((q=y*k/5*(2+sin(d*2+y-t*4))+80)*cos(c=d/4-t/2+i%2*3)+200,q*sin(c)+d*9+60)&#xD;
t=0,draw=$=&amp;gt;{t||createCanvas(w=400,w);background(9).stroke(w,116);for(t+=PI/90,i=1e4;i--;)a()}&#xD;
&#xD;
## Translation into Wolfram Language Compile function&#xD;
&#xD;
    exactPointData = Compile[{{t, _Real}},&#xD;
       Table[&#xD;
        Module[{y, k, e, d, q, c, xCoord, yCoord, iVal},&#xD;
         &#xD;
         iVal = N[i]; &#xD;
         y = iVal/790.0;&#xD;
         e = y/3.0 - 13.0;&#xD;
         &#xD;
         k = If[y &amp;lt; 8.0, &#xD;
            9.0 + 6.0 * Sin[BitXor[Floor[y], 9]], &#xD;
            4.0 + Cos[y]&#xD;
           ] * Cos[iVal + t/4.0];&#xD;
         &#xD;
         d = Sqrt[k^2 + e^2] + Cos[e + t*2.0 + Mod[i, 2]*4.0];&#xD;
         q = (y * k / 5.0) * (2.0 + Sin[d*2.0 + y - t*4.0]) + 80.0;&#xD;
         c = d/4.0 - t/2.0 + Mod[i, 2]*3.0;&#xD;
    &#xD;
         xCoord = q * Cos[c] + 200.0;&#xD;
         yCoord = -(q * Sin[c] + d*9.0 + 60.0);&#xD;
         &#xD;
         {xCoord, yCoord}&#xD;
         ],&#xD;
        &#xD;
        {i, 9999, 0, -1}&#xD;
        ],&#xD;
       RuntimeOptions -&amp;gt; &amp;#034;Speed&amp;#034;&#xD;
       ];&#xD;
&#xD;
## Collage of random frames, rotations, reflections&#xD;
&#xD;
    ImageCollage[Table[&#xD;
    ImageCrop@&#xD;
    ImageRotate[#,RandomChoice[{0,Pi}]]&amp;amp;@&#xD;
    ImageReflect[#,RandomChoice[{Left,Top}]]&amp;amp;@&#xD;
    Rasterize[Graphics[&#xD;
      {Opacity[0.9], PointSize[.002], White,Point[exactPointData[RandomReal[8Pi]]]},&#xD;
      Background -&amp;gt; GrayLevel[0.035], (* background(9) approx 9/255 *)&#xD;
      PlotRange -&amp;gt; {{40, 360}, {-390, -10}}, &#xD;
      ImageSize -&amp;gt; 550&#xD;
      ]],6],Method-&amp;gt;&amp;#034;Rows&amp;#034;]&#xD;
&#xD;
![enter image description here][2]&#xD;
&#xD;
## 3D image stack in semitransparent background &#xD;
&#xD;
    Image3D[Rasterize/@frames,ViewPoint-&amp;gt;Top,Background-&amp;gt;Opacity[.75],ImageSize-&amp;gt;550]&#xD;
&#xD;
![enter image description here][3]&#xD;
&#xD;
## 3D image stack rotation in fully transparent background &#xD;
&#xD;
    Image3D[Rasterize/@frames,ColorFunction-&amp;gt;&amp;#034;XRay&amp;#034;,&#xD;
    Background-&amp;gt;Black,BoxRatios-&amp;gt;{1, 1, 1},SphericalRegion-&amp;gt;True]&#xD;
&#xD;
![enter image description here][4]&#xD;
&#xD;
## Animate with Manipulate function:&#xD;
&#xD;
    Manipulate[&#xD;
     Graphics[&#xD;
      {Opacity[0.75], PointSize[.002], White,Point[exactPointData[t]]},&#xD;
      Background -&amp;gt; GrayLevel[0.035], &#xD;
      PlotRange -&amp;gt; {{40, 360}, {-390, -10}}, &#xD;
      ImageSize -&amp;gt; 550&#xD;
      ],&#xD;
     {{t, 19.35, &amp;#034;Time&amp;#034;}, 19.35, 19.35+ 8 Pi,AnimationRate-&amp;gt;.1,Appearance-&amp;gt;&amp;#034;Open&amp;#034;}&#xD;
    ]&#xD;
&#xD;
![enter image description here][5]&#xD;
&#xD;
## Animated GIF (see top image)&#xD;
&#xD;
    frames=Table[&#xD;
     Graphics[&#xD;
      {Opacity[0.9], PointSize[.002], White,Point[exactPointData[t]]},&#xD;
      Background -&amp;gt; GrayLevel[0.035], (* background(9) approx 9/255 *)&#xD;
      PlotRange -&amp;gt; {{40, 360}, {-390, -10}}, &#xD;
      ImageSize -&amp;gt; 550&#xD;
      ],&#xD;
     {t, 19.35, 19.35+ 4 Pi, 4 Pi/200.}&#xD;
    ];&#xD;
    &#xD;
    SetDirectory[NotebookDirectory[]]&#xD;
    &#xD;
    Export[&amp;#034;wjelly.gif&amp;#034;,frames,ImageSize-&amp;gt;550,&amp;#034;DisplayDurations&amp;#034;-&amp;gt;.03]&#xD;
&#xD;
## 3D image stack GiF - infinity spin&#xD;
&#xD;
Be carful with CPU and RAM usage for the code below.&#xD;
&#xD;
    frames=Table[&#xD;
     Rasterize@Graphics[&#xD;
      {Opacity[0.9], PointSize[.002], White,Point[exactPointData[t]]},&#xD;
      Background -&amp;gt; GrayLevel[0.035], (* background(9) approx 9/255 *)&#xD;
      PlotRange -&amp;gt; {{40, 360}, {-390, -10}}, &#xD;
      ImageSize -&amp;gt; 200&#xD;
      ],&#xD;
     {t, 19.35, 19.35+ 4 Pi, 4 Pi/200.}&#xD;
    ];&#xD;
&#xD;
    ClearAll[ing3D];&#xD;
    ing3D[d_]:=Image3D[d,ViewPoint-&amp;gt;Top,Background-&amp;gt;Opacity[.75],ImageSize-&amp;gt;550]&#xD;
    &#xD;
    frm=ParallelTable[Rasterize[ing3D[RotateLeft[frames,k]]],{k,0,200,1}];&#xD;
    &#xD;
    Export[&amp;#034;wjelly3D.gif&amp;#034;,frm,ImageSize-&amp;gt;550,&amp;#034;DisplayDurations&amp;#034;-&amp;gt;.03]&#xD;
&#xD;
![enter image description here][6]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=wjelly2-ezgif.com-optimize.gif&amp;amp;userId=11733&#xD;
  [2]: https://community.wolfram.com//c/portal/getImageAttachment?filename=4146g4q5ergfq543gdf.jpg&amp;amp;userId=11733&#xD;
  [3]: https://community.wolfram.com//c/portal/getImageAttachment?filename=cdgwhsfdbfv.jpg&amp;amp;userId=11733&#xD;
  [4]: https://community.wolfram.com//c/portal/getImageAttachment?filename=sfd4w5wfdadsfSDF4.gif&amp;amp;userId=11733&#xD;
  [5]: https://community.wolfram.com//c/portal/getImageAttachment?filename=fg4qdsbb54.jpg&amp;amp;userId=11733&#xD;
  [6]: https://community.wolfram.com//c/portal/getImageAttachment?filename=wjelly3D-ezgif.com-optimize.gif&amp;amp;userId=11733</description>
    <dc:creator>Vitaliy Kaurov</dc:creator>
    <dc:date>2026-02-10T06:13:14Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3607816">
    <title>[WWS26] Exploring hydrogen bonding patterns in proteins</title>
    <link>https://community.wolfram.com/groups/-/m/t/3607816</link>
    <description>![Exploring Hydrogen Bonding Patterns in Proteins][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=hBondGraph.png&amp;amp;userId=3607438&#xD;
  [2]: https://www.wolframcloud.com/obj/3b73030e-7416-4f1a-b858-751efa05c461</description>
    <dc:creator>Christoph Steck</dc:creator>
    <dc:date>2026-01-15T21:48:27Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3607149">
    <title>[WWS26] Percolation in fitness-neutral sets in the minimal model for biological evolution</title>
    <link>https://community.wolfram.com/groups/-/m/t/3607149</link>
    <description>![Percolation in fitness-neutral sets in the minimal model for biological evolution][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=merged.png&amp;amp;userId=20103&#xD;
  [2]: https://www.wolframcloud.com/obj/1f95bf03-2555-4bb3-93ad-a3c7e1deba30</description>
    <dc:creator>Rami Zakh</dc:creator>
    <dc:date>2026-01-15T18:35:21Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3606767">
    <title>[WWS26] Computational study of heat transfer enhancement with ethylene glycol-graphene nanofluids</title>
    <link>https://community.wolfram.com/groups/-/m/t/3606767</link>
    <description>![This image explains that the suspension of nanoparticles in the base fluid/conventional heat carrier fluids produces nanofluid--- an improved heat carrier fluid ][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=DefinitionofNanofluid.png&amp;amp;userId=3572506&#xD;
  [2]: https://www.wolframcloud.com/obj/d174bbab-054d-4f2d-a8fa-6f83a5893113</description>
    <dc:creator>Lateefat Aselebe</dc:creator>
    <dc:date>2026-01-15T02:13:16Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3597063">
    <title>Introduction to dynamic economic models: the predator-prey system</title>
    <link>https://community.wolfram.com/groups/-/m/t/3597063</link>
    <description>&amp;amp;[Wolfram Notebook][1]&#xD;
&#xD;
&#xD;
  [1]: https://www.wolframcloud.com/obj/6c5bed41-b6e1-4849-ae85-8f7586c25b93</description>
    <dc:creator>Hee-Young Shin</dc:creator>
    <dc:date>2025-12-25T21:26:33Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3597072">
    <title>Introduction to dynamic economic models: epidemic models of infectious diseases</title>
    <link>https://community.wolfram.com/groups/-/m/t/3597072</link>
    <description>&amp;amp;[Wolfram Notebook][1]&#xD;
&#xD;
&#xD;
  [1]: https://www.wolframcloud.com/obj/31b8731c-e1a6-4ccc-a5ec-7fcd62cd6b50</description>
    <dc:creator>Hee-Young Shin</dc:creator>
    <dc:date>2025-12-25T21:27:55Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3586632">
    <title>Applying computational irreducibility to free will and Cconsciousness</title>
    <link>https://community.wolfram.com/groups/-/m/t/3586632</link>
    <description>I&amp;#039;ve developed two theoretical frameworks that extend Wolfram&amp;#039;s work on computational irreducibility and Class 4 systems to foundational problems in philosophy of mind.&#xD;
&#xD;
[CIFW (Computational Irreducibility and Free Will)][1] argues that the phenomenology of free will, the felt sense that multiple futures are genuinely open during deliberation, corresponds directly to Class 4 computational dynamics in neural decision-making. The subjective experience of freedom isn&amp;#039;t illusion, but the epistemic signature of computationally irreducible processes where outcomes cannot be predicted without step-by-step execution.&#xD;
&#xD;
[CIPC (Computational Irreducibility and Phenomenal Consciousness)][2] proposes that qualia emerge necessarily when systems exhibit: (1) Class 4 dynamics, (2) self-modeling, (3) environmental modeling, (4) information integration, and (5) operation under uncertainty. Consciousness isn&amp;#039;t something added to computation, it&amp;#039;s what Class 4 self-referential computation is like from the system&amp;#039;s own perspective.&#xD;
&#xD;
Both papers make testable predictions via EEG complexity measures and comparative neuroscience, and both dissolve rather than solve their respective philosophical problems by revealing them as category errors.&#xD;
&#xD;
I would be honored if the community could give their opinion on my ideas.&#xD;
&#xD;
&#xD;
  [1]: https://osf.io/preprints/psyarxiv/e5ajp&#xD;
  [2]: https://zenodo.org/records/17834417</description>
    <dc:creator>Rafael Almeida Reis</dc:creator>
    <dc:date>2025-12-06T10:44:02Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3585501">
    <title>A school of swimming jellyfish: trigonometric and boolean rendering</title>
    <link>https://community.wolfram.com/groups/-/m/t/3585501</link>
    <description>![A school of swimming jellyfish: trigonometric and boolean rendering ][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=fishyjelly2-ezgif.com-optimize.gif&amp;amp;userId=11733&#xD;
  [2]: https://www.wolframcloud.com/obj/1650c140-fea8-42bf-ac77-ba7cd9a0a725</description>
    <dc:creator>Vitaliy Kaurov</dc:creator>
    <dc:date>2025-12-04T11:45:25Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3582366">
    <title>A framework for modelling gene regulation which accommodates non-equilibrium mechanisms</title>
    <link>https://community.wolfram.com/groups/-/m/t/3582366</link>
    <description>![A framework for modelling gene regulation which accommodates non-equilibrium mechanisms][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=Aframeworkformodellinggeneregulationwhichaccommodatesnon-equilibriummechanisms2.png&amp;amp;userId=20103&#xD;
  [2]: https://www.wolframcloud.com/obj/419d1e91-b71e-43f5-9c79-c7ae37ccac97</description>
    <dc:creator>Jeremy Gunawardena</dc:creator>
    <dc:date>2025-11-26T21:06:30Z</dc:date>
  </item>
  <item rdf:about="https://community.wolfram.com/groups/-/m/t/3574743">
    <title>Truss structure optimization using a genetic algorithm</title>
    <link>https://community.wolfram.com/groups/-/m/t/3574743</link>
    <description>![Truss structure optimization using a genetic algorithm][1]&#xD;
&#xD;
&amp;amp;[Wolfram Notebook][2]&#xD;
&#xD;
&#xD;
  [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=Trussstructureoptimizationusingageneticalgorithm.png&amp;amp;userId=20103&#xD;
  [2]: https://www.wolframcloud.com/obj/e038db24-853f-492a-bebf-ebd6e4526092</description>
    <dc:creator>Diego Alves</dc:creator>
    <dc:date>2025-11-13T17:11:12Z</dc:date>
  </item>
</rdf:RDF>

