Skip to main
Zenodo home
Communities
My dashboard
Log in Sign up
The Axiomatic Physical Homeostasis Framework
Published December 15, 2025 | Version v1
Preprint Open

The Universal Thin Filament Code

Authors/Creators

  • Schutza, Aaron Moore ORCID icon

Description

A Universal Thin Filament Solver based on the Geometric Rule 30 Cellular Automata.

Files

TFC30.pdf

Files (214.1 kB)

Name Size Download all
TFC30.pdf
md5:b5090df6864900816acfdbc4e1ba3a05
214.1 kB Preview Download
26
Views
20
Downloads
Show more details
All versions This version
Views

Total views

26 26
Downloads

Total downloads

20 20
Data volume

Total data volume

5.6 MB 5.6 MB

More info on how stats are collected....

Versions

External resources

Indexed in
  • OpenAIRE

Communities

Details

DOI
10.5281/zenodo.17943973
DOI Badge

DOI

10.5281/zenodo.17943973

Markdown

[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.17943973.svg)](https://doi.org/10.5281/zenodo.17943973)

reStructuredText

.. image:: https://zenodo.org/badge/DOI/10.5281/zenodo.17943973.svg
  :target: https://doi.org/10.5281/zenodo.17943973

HTML

<a href="https://doi.org/10.5281/zenodo.17943973"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.17943973.svg" alt="DOI"></a>

Image URL

https://zenodo.org/badge/DOI/10.5281/zenodo.17943973.svg

Target URL

https://doi.org/10.5281/zenodo.17943973
Resource type
Preprint
Publisher
Zenodo

Rights

License
cc-by-4.0 icon Creative Commons Attribution 4.0 International
The Creative Commons Attribution license allows re-distribution and re-use of a licensed work on the condition that the creator is appropriately credited. Read more

Citation

Export

Technical metadata

Created
December 15, 2025
Modified
January 2, 2026

About

  • About
  • Policies
  • Infrastructure
  • Principles
  • Projects
  • Roadmap
  • Contact

Blog

  • Blog

Support

  • Help
  • FAQ

Developers

  • REST API
  • OAI-PMH

Contribute

  • GitHub
  • Donate

Funded by

Powered by CERN Data Centre & InvenioRDM

  • Status
  • Privacy policy
  • Cookie policy
  • Terms of Use

This site uses cookies. Find out more on how we use cookies