Archive for the ‘Cellular Automata’ Category

Introduction to Complexity course is now enrolling!

Tuesday, February 5th, 2013

Santa Fe Institute’s Introduction to Complexity course is now enrolling!

From the webpage:

This free online course is open to anyone, and has no prerequisites. Watch the Intro Video to learn what this course is about and how to take it. Enroll to sign up, and you can start the course immediately. See the Syllabus and the Frequently Asked Questions to learn more.

I am waiting for the confirmation email now.

Definitely worth your attention.

Not that I think subject identity is fractal in nature.

Fractals as you know have a self-similarity property and at least in my view, subject identity does not.

As you explore a subject identity, you encounter other subjects identities, which isn’t the same thing as being self-similar.

Or should I say you will encounter complexities of subject identities?

Like all social constructs, identification of a subject is simple because we have chosen to view it that way.

Are you ready to look beyond our usual assumptions?

Update: Introduction to Complexity [Santa Fe Institute]

Wednesday, December 5th, 2012

The Santa Fe Institute has released the FAQ and syllabus for its “Introduction to Complexity” course in 2013.

The course starts January 28, 2013 and will last for eleven (11) weeks.

Lecture units:

  1. What is Complexity?
  2. Dynamics, Chaos, and Fractals
  3. Information, Order, and Randomness
  4. Cellular Automata
  5. Genetic Algorithms
  6. Self-Organization in Nature
  7. Modeling Social Systems
  8. Networks
  9. Scaling
  10. Cities as Complex Systems
  11. Course Field Trip; Final Exam

Funding permitting there may be a Complexity part II in the summer of 2013.

Your interest and participation in this course may help drive the appearance of the second course.

An earlier post on the course: Introduction to Complexity [Santa Fe Institute].

Conway’s Game of Life for Curved Surfaces (Parts 1 and 2)

Thursday, November 29th, 2012

Conway’s Game of Life for Curved Surfaces (Part 1) and Conway’s Game of Life for Curved Surfaces (Part 2) by Mikola Lysenko.

A generalization of John Conway’s original Game of Life on curved surfaces.

Definitely not for the faint of heart and will likely have you consulting old text books.

A simple game that even in its original version, unfolds into complexity. To say nothing of the extended version.

See Cellular automaton (history and applications).

I first saw this in a tweet from Math Update.

Adventures In Declarative Programming: Conway’s Game Of Life

Friday, August 31st, 2012

Adventures In Declarative Programming: Conway’s Game Of Life by Manuel Rotter.

From the post:

My first blog post about declarative programming explained how to write a Sudoku solver in the logic programming language Prolog. This time I’ll show you how to implement Conway’s Game of Life in the functional programming language Clojure.

But before that, let me explain a few general things. The first three paragraphs are for readers who are not familiar with certain concepts. People who already know what Clojure or Conway’s Game of Life is, may feel free to skip those paragraphs. It starts getting serious at “Game of Life in Clojure”.

Having a result that interests me makes learning something new easier.

Here it is “Conway’s Game of Life,” a two dimensional type of Cellular Automata.

You may also find the following of interest:

Game of Life 3D

The Game of Life in 3D (using three.js)

If you have heard of Wolfram’s A New Kind of Science, be aware the full text is online for free viewing with other materials at: Wolfram Science.

A Computable Universe,
Understanding Computation and
Exploring Nature As Computation

Friday, June 1st, 2012

Foreword: A Computable Universe, Understanding Computation and Exploring Nature As Computation by Roger Penrose.

Abstract:

I am most honoured to have the privilege to present the Foreword to this fascinating and wonderfully varied collection of contributions, concerning the nature of computation and of its deep connection with the operation of those basic laws, known or yet unknown, governing the universe in which we live. Fundamentally deep questions are indeed being grappled with here, and the fact that we find so many different viewpoints is something to be expected, since, in truth, we know little about the foundational nature and origins of these basic laws, despite the immense precision that we so often find revealed in them. Accordingly, it is not surprising that within the viewpoints expressed here is some unabashed speculation, occasionally bordering on just partially justified guesswork, while elsewhere we find a good deal of precise reasoning, some in the form of rigorous mathematical theorems. Both of these are as should be, for without some inspired guesswork we cannot have new ideas as to where look in order to make genuinely new progress, and without precise mathematical reasoning, no less than in precise observation, we cannot know when we are right — or, more usually, when we are wrong.

An unlikely volume to search for data mining or semantic modeling algorithms or patterns.

But one that should be read for the mental exercise/discipline of its reading.

The asking price of $138 (US) promises a limited readership.

Plus a greatly diminished impact.

When asked to participate in collections, scholars/authors should ask themselves:

How many books have I read from publisher X?*

*Read, not cited, is the appropriate test. Make your decision appropriately.


If republished as an accessible paperback, may I suggest: “Exploring the Nature of Computation”?

The committee title makes the collage nature of the volume a bit too obvious.

Clojure Game of Life

Monday, April 2nd, 2012

Clojure Game of Life

From the post:

This is a Conway’s Game of Life in functional style written in Clojure.

Wikipedia (Cellular Automaton) mentions:

Cellular automata are also called “cellular spaces”, “tessellation automata”, “homogeneous structures”, “cellular structures”, “tessellation structures”, and “iterative arrays”.

You may recall that Stephen Wolfram wrote A New Kind of Science (1280 pages) about cellular automata. Had a great author. Needed a great editor as well.

At a minimum, I take cellular automata for the proposition that computational artifacts exist, whether we expect or forecast them or not.

At a maximum, well, that’s an open research question isn’t it?