Notices : : Issue Table of Contents

#merci

John Conway’s Game of Life - Einführung in Zellulare Automaten
▻https://beltoforion.de/de/game_of_life

Une simulation en Javascript qui se joue en ligne

Wegen der Einfachheit des Regelsatzes ist die Implementierung von Game of Life eine beliebte Aufgabe für Programmieranfänger. Der Quellcode des hier verwendeten „Game of Life“-Applets ist in Typescript geschrieben und kann bei GitHub herunter geladen werden. Eine Beschreibung der Implementierung des Game of Life in Python befindet sich in einem anderen Artikel auf dieser Webseite.

puis ...
John Conway’s Game of Life
▻https://bitstorm.org/gameoflife

The Simulation

Golly Game of Life Home Page
▻http://golly.sourceforge.net

Golly - Apps on Google Play
▻https://play.google.com/store/apps/details?id=net.sf.golly

‎Golly on the App Store
▻https://apps.apple.com/us/app/golly/id553184760

Golly is an open source, cross-platform application for exploring Conway’s Game of Life and many other types of cellular aut

Python Version von John Conways Game of Life
▻https://beltoforion.de/de/unterhaltungsmathematik/game_of_life.php

import pygame
import numpy as np

col_about_to_die = (200, 200, 225)
col_alive = (255, 255, 215)
col_background = (10, 10, 40)
col_grid = (30, 30, 60)

def update(surface, cur, sz) :
nxt = np.zeros((cur.shape[0], cur.shape[1]))

for r, c in np.ndindex(cur.shape) :
num_alive = np.sum(cur[r-1:r+2, c-1:c+2]) - cur[r, c]

if cur[r, c] == 1 and num_alive < 2 or num_alive > 3 :
col = col_about_to_die
elif (cur[r, c] == 1 and 2 <= num_alive <= 3) or (cur[r, c] == 0 and num_alive == 3) :
nxt[r, c] = 1
col = col_alive

col = col if cur[r, c] == 1 else col_background
pygame.draw.rect(surface, col, (c*sz, r*sz, sz-1, sz-1))

return nxt

def init(dimx, dimy) :
cells = np.zeros((dimy, dimx))
pattern = np.array([[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0],
[1,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[1,1,0,0,0,0,0,0,0,0,1,0,0,0,1,0,1,1,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]]) ;
pos = (3,3)
cells[pos[0]:pos[0]+pattern.shape[0], pos[1]:pos[1]+pattern.shape[1]] = pattern
return cells

def main(dimx, dimy, cellsize) :
pygame.init()
surface = pygame.display.set_mode((dimx cellsize, dimy cellsize))
pygame.display.set_caption("John Conway’s Game of Life")

cells = init(dimx, dimy)

while True :
for event in pygame.event.get() :
if event.type == pygame.QUIT :
pygame.quit()
return

surface.fill(col_grid)
cells = update(surface, cells, cellsize)
pygame.display.update()

if _name_ == « _main_ » :
main(120, 90, 8)

John Horton Conway
▻https://de.wikipedia.org/wiki/John_Horton_Conway

John Horton Conway ( 26. Dezember 1937 in Liverpool, Vereinigtes Königreich; † 11. April 2020 in New Brunswick, New Jersey, Vereinigte Staaten) war ein britischer Mathematiker.
...
Nach seinen bedeutendsten Leistungen gefragt, hob er 2013 seine Entdeckung surrealer Zahlen hervor und seinen Beweis des Free Will Theorems in der Quantenmechanik mit Simon Kochen und weniger seine Arbeiten in Gruppentheorie, für die er vor allem bekannt war. Das Free Will Theorem wurde von Conway und Kochen 2004 bewiesen und besagt, dass, falls beim Experimentator Entscheidungsfreiheit (freier Wille, Möglichkeit nicht vorherbestimmten Verhaltens) vorhanden ist, dies (unter schwachen Voraussetzungen) in gewissem Sinne auch für alle Elementarteilchen gilt .

[quant-ph/0604079v1] The Free Will Theorem
▻https://arxiv.org/abs/quant-ph/0604079v1

John Conway, Simon Kochen

On the basis of three physical axioms, we prove that if the choice of a particular type of spin 1 experiment is not a function of the information accessible to the experimenters, then its outcome is equally not a function of the information accessible to the particles. We show that this result is robust, and deduce that neither hidden variable theories nor mechanisms of the GRW type for wave function collapse can be made relativistic. We also establish the consistency of our axioms and discuss the philosophical implications.

▻http://www.ams.org/notices/200902/rtx090200226p.pdf

#informatique #simulation #automate_cellulaire #machine_de_Turing #mathématique #physique #logique #philosophie