Long Ouyang
Period 5
Soap Bubbles to Solve the Steinger Tree Problem<

NetLogo
Oct. 5: setting up the basic system 

Oct. 7 - Nodes that will connect. Convex hulls are the bubbles. Will use 
screenshots to document process.

Oct. 14 - Finished with convex hulls portions. Now calculating equations for
   forces and surface energy. 

Oct. 19 - Current applet
  The black nodes and soap bubbles are turtles.  Black nodes are the given graph.
  The bubbles are locating the most efficient graph structure to include themselves.
   Edges need to be drawn.
Nov. 4 - Website

Dec. 14 Current Status Update
	Status as of 12/14

	Right now, I'm researching computability theory and the Church-Turing 
	thesis. There seems to be a widespread misconception that the Church-Turing 
	thesis implies polynomial time simulation of physical phenomena, which 
	is apocryphal. From a theory standpoint, such a shortcut would make for a 
	relatively simple proof, but I am looking for an authoritative source on
	the relation between physical processes and computation. In terms of software, 
	I have moved away from netlogo, and am using a package called Easy Java
	Simulations, available from Open Source Physics (opensourcephysics.org). 
	Despite its name, Easy Java Simulations is fairly complex, so I'm stepping 
	through its tutorials.