■ CONES.PAS — BOMBELLI & MEYER 1987 CAUSAL SET REVIVAL

Bombelli & Meyer 1987 Causal Set Simulated Annealing Revival

A Python 3.12 revival and empirical audit of the 1987 Pascal simulated-annealing program for embedding causal sets into Minkowski spacetime.

Original program: Luca Bombelli, written in collaboration with David Meyer — PhD thesis, Appendix A.2, Syracuse University, 1987.

Python revival: José Ignacio Martín Gandul, 2026.

■ WHAT_THIS_IS.TXT

What This Is

This project preserves, ports, and tests an early causal set algorithm from Luca Bombelli's 1987 PhD thesis. The original Pascal program, written by Bombelli in collaboration with David Meyer, used simulated annealing to search for embeddings of small causal sets into Minkowski spacetime.

The revival provides readable Python code, reproducible CPU experiments, ensemble statistics, order-theoretic diagnostics, benchmark tables, and historical context. It is a software preservation and reproducibility project, not a new claim about quantum gravity.

■ FAQ.TXT

Common questions / Preguntas frecuentes

Short answers with public sources. Respuestas breves con fuentes públicas.

Questions in English

What is the Bombelli and Meyer 1987 causal-set revival?

It is a Python 3.12 port and empirical audit of the Pascal simulated-annealing program in Appendix A.2 of Luca Bombelli’s 1987 thesis, written in collaboration with David Meyer. José Ignacio Martín Gandul created the 2026 revival, with public code, tests and data.

Sources: Project README · Full project paper

What is a causal set, and is it the same as a QCA?

A causal set is a locally finite partially ordered set: its order represents causal precedence. It is not a quantum cellular automaton, which specifies local quantum dynamics on a lattice. This project searches for Minkowski coordinates compatible with a small causal set; it does not simulate a QCA.

Sources: Original causal-set paper (1987) · QCA/QW student atlas

Where can I find Python code for causal-set embedding?

The public nacho09021973/bombelli repository contains cones.py, benchmark inputs, tests and an MIT license. Its simulated annealer searches for a low-energy coordinate embedding in Minkowski spacetime. The README explains how to download and run it.

Sources: Source code · Run instructions · MIT license

Does changing the cooling schedule improve the causal-set embedding?

On the published 12-element benchmark, T0=100 and alpha=0.9 yield 0/100 runs with final energy below 1e-6; T0=180 and alpha=0.8 yield 95/100. The tuned schedule was selected by an empirical grid scan. This result concerns that benchmark and optimizer, not arbitrary causal sets or a general proof of embeddability.

Sources: Published comparison CSV · Experiment and success threshold

Where are the data, and how can I reproduce the 100-seed comparison?

The committed comparison is data/schedule_comparison.csv. From the repository root, run python experiments.py schedule to regenerate it with the fixed schedules, 100 seeds starting at 1959, and SCHEDULE_DIM=3. This is the reproduction command; a single demonstration run does not reproduce the ensemble.

Sources: Comparison data · Experiment definitions · Reproduction instructions

How do I cite the project or an exact archived release?

Cite José Ignacio Martín Gandul, Thirty-Nine Years of Simulated Annealing on a Causal Set: A Revival of Bombelli (1987) with 2026 Tools (2026). The concept DOI is 10.5281/zenodo.20307735; release 2.1.4 has DOI 10.5281/zenodo.23191566. Cite the 1987 thesis or original causal-set paper separately for the historical work.

Sources: Citation metadata · Release 2.1.4 · All versions DOI

Does this project solve quantum gravity or the general causal-set embedding problem?

No. It preserves and tests one historical optimization algorithm on declared inputs and ensembles. A low-energy embedding or a successful benchmark does not establish a new quantum-gravity theory, nor does optimizer failure prove that a causal set cannot be embedded.

Sources: Project scope · Full project paper

Do I need a GPU or extra Python packages to run the simulation?

No GPU is required. The simulation and experiments use Python 3.12 and the standard library. From the downloaded repository, python cones.py inputs/tesis_like_12.in --dim 2 runs a demonstration; python validation_suite.py runs the smallest validation example. Development tests have separate dependencies documented in the README.

Sources: Requirements and commands · Command-line arguments

Preguntas en español

¿Qué es la recuperación del programa de Bombelli y Meyer de 1987?

Es una versión en Python 3.12 y una auditoría empírica del programa Pascal de recocido simulado del apéndice A.2 de la tesis de Luca Bombelli de 1987, escrito con David Meyer. José Ignacio Martín Gandul realizó la recuperación de 2026, con código, pruebas y datos públicos.

Fuentes: Project README · Full project paper

¿Qué es un conjunto causal y es lo mismo que un QCA?

Un conjunto causal es un conjunto parcialmente ordenado y localmente finito: el orden representa precedencia causal. No es un autómata celular cuántico, que especifica una dinámica cuántica local en una red. Este proyecto busca coordenadas de Minkowski compatibles con un conjunto causal pequeño; no simula un QCA.

Fuentes: Original causal-set paper (1987) · QCA/QW student atlas

¿Dónde encontrar código Python para embeber conjuntos causales?

El repositorio público nacho09021973/bombelli contiene cones.py, entradas de prueba, tests y licencia MIT. Su recocido simulado busca coordenadas de Minkowski con energía baja para el conjunto causal. El README explica cómo descargarlo y ejecutarlo.

Fuentes: Source code · Run instructions · MIT license

¿Mejora el resultado al cambiar el enfriamiento del recocido simulado?

En la prueba publicada de 12 elementos, T0=100 y alpha=0.9 dan 0/100 ejecuciones con energía final inferior a 1e-6; T0=180 y alpha=0.8 dan 95/100. Los parámetros ajustados se seleccionaron mediante un barrido empírico. El resultado corresponde a esa prueba y ese optimizador, no a cualquier conjunto causal ni a una demostración general de embebibilidad.

Fuentes: Published comparison CSV · Experiment and success threshold

¿Dónde están los datos y cómo reproducir la comparación de 100 semillas?

La comparación está en data/schedule_comparison.csv. Desde la raíz del repositorio, ejecuta python experiments.py schedule para regenerarla con los parámetros fijados, 100 semillas desde 1959 y SCHEDULE_DIM=3. Ese es el comando de reproducción; una ejecución de demostración no reproduce el conjunto de 100.

Fuentes: Comparison data · Experiment definitions · Reproduction instructions

¿Cómo citar el proyecto o una versión archivada concreta?

Cita a José Ignacio Martín Gandul, Thirty-Nine Years of Simulated Annealing on a Causal Set: A Revival of Bombelli (1987) with 2026 Tools (2026). El DOI general es 10.5281/zenodo.20307735; la versión 2.1.4 tiene DOI 10.5281/zenodo.23191566. Cita por separado la tesis o el artículo original de 1987 cuando corresponda.

Fuentes: Citation metadata · Release 2.1.4 · All versions DOI

¿Este proyecto resuelve la gravedad cuántica o el problema general de embeber conjuntos causales?

No. Conserva y estudia un algoritmo histórico de optimización con entradas y conjuntos de pruebas definidos. Un embebimiento de energía baja o un éxito en una prueba no establece una nueva teoría de gravedad cuántica. El fallo del optimizador tampoco demuestra imposibilidad de embebimiento.

Fuentes: Project scope · Full project paper

¿Necesito GPU o paquetes adicionales para ejecutar la simulación?

No hace falta GPU. La simulación y los experimentos usan Python 3.12 y su biblioteca estándar. Desde el repositorio descargado, python cones.py inputs/tesis_like_12.in --dim 2 ejecuta una demostración y python validation_suite.py ejecuta el ejemplo mínimo de validación. El README especifica las dependencias adicionales de los tests de desarrollo.

Fuentes: Requirements and commands · Command-line arguments

■ RESULTS.OUT

Main Results

The experiments compare Bombelli and Meyer's original annealing schedule with modern repeated runs across seeds and parameters. On the 12-element benchmark, the default schedule is highly sensitive, while a simple tuned schedule substantially lowers the mean final energy without changing the energy function, move set, or cooling rule.

The repository also includes checks for warmup behavior, finite-size dimension estimators, and order-theoretic correlates of optimization difficulty.

T0=100 alpha=0.9 -> mean final energy 22.735  (0/100 with E<1e-6)
T0=180 alpha=0.8 -> mean final energy  0.000 (95/100 with E<1e-6)

The means are rounded to three decimal places. Near-zero means final energy below 1e-6; this is not a claim of exact zero in every run. Comparison data · Experiment definition.

■ CITE.ME

Archive and Citation

The project is archived on Zenodo and linked to the public GitHub repository. Cite the evolving project as José Ignacio Martín Gandul, Thirty-Nine Years of Simulated Annealing on a Causal Set: A Revival of Bombelli (1987) with 2026 Tools, Zenodo, concept DOI: 10.5281/zenodo.20307735. For reproducibility, use the version-specific DOI shown on the exact Zenodo release.

The original program is cited as L. Bombelli, Space-time as a Causal Set, PhD thesis, Syracuse University, 1987 (Appendix A.2, written in collaboration with D. Meyer).

■ LINKS.LST
■ RUN.BAT

How to Run

Python 3.12; the simulation uses the standard library and an ordinary CPU. Download or clone the repository, then run these demonstration commands from its root directory:

python cones.py inputs/tesis_like_12.in --dim 2
python validation_suite.py

To reproduce the published 100-seed schedule comparison, run python experiments.py schedule. Full setup and reproduction instructions.

F1 Help F2 Save F9 Compile Alt-X Exit