GMU:Bits, Beats & Pieces/Lalalolo/lalalolo/Projekt - Revision history

Max: /* Further Reading: */

2019-06-05T15:26:04Z

Max: /* Further Reading: */

2019-06-05T15:25:33Z

Max: /* Concept: */

2019-06-05T15:24:28Z

Concept:

← Older revision		Revision as of 15:24, 5 June 2019
Line 19:		Line 19:


	[[File:rules.png\|800px]		[[File:rules.png\|800px]]

	One rule-set and its representation		One rule-set and its representation
Line 43:		Line 43:

	Different penatonic scales and the matching notes		Different penatonic scales and the matching notes




	===Approach:===		===Approach:===

Lalalolo: /* */

2019-03-21T22:43:10Z

← Older revision		Revision as of 22:43, 21 March 2019
Line 1:		Line 1:
	=<automata>=		==<automata>==

	===Context:===		===Context:===

Lalalolo: /* */

2019-03-21T22:43:00Z

← Older revision		Revision as of 22:43, 21 March 2019
Line 1:		Line 1:
	==<automata>==		=<automata>=

	===Context:===		===Context:===

Lalalolo: /* */

2019-03-21T22:42:43Z

← Older revision		Revision as of 22:42, 21 March 2019
Line 85:		Line 85:

	===Downloads===		===Downloads===
	[[:File:Just open index.html with a modern browser ~~automata.zip]]~~		[[File:automata.zip]]
			Just open index.html with a modern browser

Lalalolo: /* */

2019-03-21T22:42:17Z

← Older revision		Revision as of 22:42, 21 March 2019
Line 7:		Line 7:
	One mathematical approach got introduced to world in 1970 by the British mathematician John Horton Conway, the Game of Life.		One mathematical approach got introduced to world in 1970 by the British mathematician John Horton Conway, the Game of Life.
	The so called Game of Life (or GoL in short) is a 'cellular automaton', a type of simulation that works on a regular grid of cells and in discrete time-steps. For every time-step a set of rules is enforced for every cell, determining it's state. In most cellular automaton there are only two states 'living' and 'dead'. Depending on the rules and other constrains of the simulation, complex patterns might occur and this project will try to take these patterns and represent them as notes in a 'cellular automaton synthesizer'.		The so called Game of Life (or GoL in short) is a 'cellular automaton', a type of simulation that works on a regular grid of cells and in discrete time-steps. For every time-step a set of rules is enforced for every cell, determining it's state. In most cellular automaton there are only two states 'living' and 'dead'. Depending on the rules and other constrains of the simulation, complex patterns might occur and this project will try to take these patterns and represent them as notes in a 'cellular automaton synthesizer'.



	[[File:dim.png\|800px]]		[[File:dim.png\|800px]]
Line 15:		Line 17:
	For this project I will use a one-dimensional or so called elementary cellular automaton, represented as a line of 32 cells. In every time-step of the simulation the state of the cell (living or dead) is considered and than the state of the two neighboring cells, edge-cells will be wrapped around. Living cells will be represented as black and dead cells as white pixel. Rules are encoded by all of the possible combinations of the dead cell itself and its neighboring (2^3 = 8). To represent the rules, they are encoded in one-bit-array of length eight like the following graphic illustrates.		For this project I will use a one-dimensional or so called elementary cellular automaton, represented as a line of 32 cells. In every time-step of the simulation the state of the cell (living or dead) is considered and than the state of the two neighboring cells, edge-cells will be wrapped around. Living cells will be represented as black and dead cells as white pixel. Rules are encoded by all of the possible combinations of the dead cell itself and its neighboring (2^3 = 8). To represent the rules, they are encoded in one-bit-array of length eight like the following graphic illustrates.

	[[File:rules.png\|~~500px~~]

			[[File:rules.png\|800px]

	One rule-set and its representation		One rule-set and its representation



	With theses 8-bits there are 256 possible combinations of rules that can be used for the simulation, these rules often form reoccurring patterns that will be important later.		With theses 8-bits there are 256 possible combinations of rules that can be used for the simulation, these rules often form reoccurring patterns that will be important later.

	[[File:all_rules.png\|~~500px~~]]

			[[File:all_rules.png\|800px]]

	Some elementary cellular automaton rules and their pattern		Some elementary cellular automaton rules and their pattern



	To interpret the simulation as music in every time-step the current line of the simulation is read and the different cells interpreted as notes in a musical scale. To minimize dissonance a anhemitonic pentatonic scale is used.		To interpret the simulation as music in every time-step the current line of the simulation is read and the different cells interpreted as notes in a musical scale. To minimize dissonance a anhemitonic pentatonic scale is used.
	Because there are only five notes per octave and no semitones in a pentatonic scale, they produce a simple harmonies that work well with random, pseudo-random and chaotic but structured input.		Because there are only five notes per octave and no semitones in a pentatonic scale, they produce a simple harmonies that work well with random, pseudo-random and chaotic but structured input.

	[[File:scales.png\|~~500px~~]]

			[[File:scales.png\|800px]]

	Different penatonic scales and the matching notes		Different penatonic scales and the matching notes




Line 36:		Line 50:
	The synthesizer works like the following, the cellular automaton is simulated using the selected rule-set. The current state or line of the automaton is than read from left to right and the matching notes of the selected pentatonic scale played (low notes left, high notes right). To give the user more control over the sound, the notes are split up into eight channels of differing pitch.		The synthesizer works like the following, the cellular automaton is simulated using the selected rule-set. The current state or line of the automaton is than read from left to right and the matching notes of the selected pentatonic scale played (low notes left, high notes right). To give the user more control over the sound, the notes are split up into eight channels of differing pitch.

	[[File:approach.png\|~~500px~~]]

			[[File:approach.png\|800px]]

	One simulation step visualized		One simulation step visualized



	The synthesizer is web-based using HTML, CSS and JavaScript. To play notes the library Tone.js (js/tone.js)and their default synthesizer is used (js/synth.js). The simulation is visualized using the Canvas-Api and simulated using native JavaScript (js/automata.js). The User-Interface is written in HTML and CSS (index.html) using onclick-event handlers to interact with the simulation (js/gui.js).		The synthesizer is web-based using HTML, CSS and JavaScript. To play notes the library Tone.js (js/tone.js)and their default synthesizer is used (js/synth.js). The simulation is visualized using the Canvas-Api and simulated using native JavaScript (js/automata.js). The User-Interface is written in HTML and CSS (index.html) using onclick-event handlers to interact with the simulation (js/gui.js).

	[[File:finished.png\|~~500px~~]]

			[[File:finished.png\|800px]]

	The final synthesizer-ui		The final synthesizer-ui



	===Further Reading:===		===Further Reading:===

Lalalolo: /* */

2019-03-21T22:41:18Z

← Older revision		Revision as of 22:41, 21 March 2019
Line 15:		Line 15:
	For this project I will use a one-dimensional or so called elementary cellular automaton, represented as a line of 32 cells. In every time-step of the simulation the state of the cell (living or dead) is considered and than the state of the two neighboring cells, edge-cells will be wrapped around. Living cells will be represented as black and dead cells as white pixel. Rules are encoded by all of the possible combinations of the dead cell itself and its neighboring (2^3 = 8). To represent the rules, they are encoded in one-bit-array of length eight like the following graphic illustrates.		For this project I will use a one-dimensional or so called elementary cellular automaton, represented as a line of 32 cells. In every time-step of the simulation the state of the cell (living or dead) is considered and than the state of the two neighboring cells, edge-cells will be wrapped around. Living cells will be represented as black and dead cells as white pixel. Rules are encoded by all of the possible combinations of the dead cell itself and its neighboring (2^3 = 8). To represent the rules, they are encoded in one-bit-array of length eight like the following graphic illustrates.

	[[:File:rules.png\|500px]		[[File:rules.png\|500px]

	One rule-set and its representation		One rule-set and its representation
Line 21:		Line 21:
	With theses 8-bits there are 256 possible combinations of rules that can be used for the simulation, these rules often form reoccurring patterns that will be important later.		With theses 8-bits there are 256 possible combinations of rules that can be used for the simulation, these rules often form reoccurring patterns that will be important later.

	[[:File:all_rules.png\|500px]]		[[File:all_rules.png\|500px]]

	Some elementary cellular automaton rules and their pattern		Some elementary cellular automaton rules and their pattern
Line 28:		Line 28:
	Because there are only five notes per octave and no semitones in a pentatonic scale, they produce a simple harmonies that work well with random, pseudo-random and chaotic but structured input.		Because there are only five notes per octave and no semitones in a pentatonic scale, they produce a simple harmonies that work well with random, pseudo-random and chaotic but structured input.

	[[:File:scales.png\|500px]]		[[File:scales.png\|500px]]

	Different penatonic scales and the matching notes		Different penatonic scales and the matching notes
Line 36:		Line 36:
	The synthesizer works like the following, the cellular automaton is simulated using the selected rule-set. The current state or line of the automaton is than read from left to right and the matching notes of the selected pentatonic scale played (low notes left, high notes right). To give the user more control over the sound, the notes are split up into eight channels of differing pitch.		The synthesizer works like the following, the cellular automaton is simulated using the selected rule-set. The current state or line of the automaton is than read from left to right and the matching notes of the selected pentatonic scale played (low notes left, high notes right). To give the user more control over the sound, the notes are split up into eight channels of differing pitch.

	[[:File:approach.png\|500px]]		[[File:approach.png\|500px]]

	One simulation step visualized		One simulation step visualized
Line 42:		Line 42:
	The synthesizer is web-based using HTML, CSS and JavaScript. To play notes the library Tone.js (js/tone.js)and their default synthesizer is used (js/synth.js). The simulation is visualized using the Canvas-Api and simulated using native JavaScript (js/automata.js). The User-Interface is written in HTML and CSS (index.html) using onclick-event handlers to interact with the simulation (js/gui.js).		The synthesizer is web-based using HTML, CSS and JavaScript. To play notes the library Tone.js (js/tone.js)and their default synthesizer is used (js/synth.js). The simulation is visualized using the Canvas-Api and simulated using native JavaScript (js/automata.js). The User-Interface is written in HTML and CSS (index.html) using onclick-event handlers to interact with the simulation (js/gui.js).

	[[:File:finished.png\|500px]]		[[File:finished.png\|500px]]

	The final synthesizer-ui		The final synthesizer-ui

Lalalolo: /* */

2019-03-21T22:40:27Z

← Older revision		Revision as of 22:40, 21 March 2019
Line 8:		Line 8:
	The so called Game of Life (or GoL in short) is a 'cellular automaton', a type of simulation that works on a regular grid of cells and in discrete time-steps. For every time-step a set of rules is enforced for every cell, determining it's state. In most cellular automaton there are only two states 'living' and 'dead'. Depending on the rules and other constrains of the simulation, complex patterns might occur and this project will try to take these patterns and represent them as notes in a 'cellular automaton synthesizer'.		The so called Game of Life (or GoL in short) is a 'cellular automaton', a type of simulation that works on a regular grid of cells and in discrete time-steps. For every time-step a set of rules is enforced for every cell, determining it's state. In most cellular automaton there are only two states 'living' and 'dead'. Depending on the rules and other constrains of the simulation, complex patterns might occur and this project will try to take these patterns and represent them as notes in a 'cellular automaton synthesizer'.

	[[File:dim.png\|~~500px~~]]		[[File:dim.png\|800px]]

	cellular automaton in different dimensions		cellular automaton in different dimensions

Line 14:		Line 15:
	For this project I will use a one-dimensional or so called elementary cellular automaton, represented as a line of 32 cells. In every time-step of the simulation the state of the cell (living or dead) is considered and than the state of the two neighboring cells, edge-cells will be wrapped around. Living cells will be represented as black and dead cells as white pixel. Rules are encoded by all of the possible combinations of the dead cell itself and its neighboring (2^3 = 8). To represent the rules, they are encoded in one-bit-array of length eight like the following graphic illustrates.		For this project I will use a one-dimensional or so called elementary cellular automaton, represented as a line of 32 cells. In every time-step of the simulation the state of the cell (living or dead) is considered and than the state of the two neighboring cells, edge-cells will be wrapped around. Living cells will be represented as black and dead cells as white pixel. Rules are encoded by all of the possible combinations of the dead cell itself and its neighboring (2^3 = 8). To represent the rules, they are encoded in one-bit-array of length eight like the following graphic illustrates.

	[[:File: One rule-set and its representation ~~rules.png]~~		[[:File:rules.png\|500px]

			One rule-set and its representation

	With theses 8-bits there are 256 possible combinations of rules that can be used for the simulation, these rules often form reoccurring patterns that will be important later.		With theses 8-bits there are 256 possible combinations of rules that can be used for the simulation, these rules often form reoccurring patterns that will be important later.

	[[:File:Some elementary cellular automaton rules and their pattern ~~all_rules.png]]~~		[[:File:all_rules.png\|500px]]

			Some elementary cellular automaton rules and their pattern

	To interpret the simulation as music in every time-step the current line of the simulation is read and the different cells interpreted as notes in a musical scale. To minimize dissonance a anhemitonic pentatonic scale is used.		To interpret the simulation as music in every time-step the current line of the simulation is read and the different cells interpreted as notes in a musical scale. To minimize dissonance a anhemitonic pentatonic scale is used.
	Because there are only five notes per octave and no semitones in a pentatonic scale, they produce a simple harmonies that work well with random, pseudo-random and chaotic but structured input.		Because there are only five notes per octave and no semitones in a pentatonic scale, they produce a simple harmonies that work well with random, pseudo-random and chaotic but structured input.

	[[:File:Different penatonic scales and the matching notes ~~scales.png\|500px]]~~		[[:File:scales.png\|500px]]

			Different penatonic scales and the matching notes


Line 29:		Line 36:
	The synthesizer works like the following, the cellular automaton is simulated using the selected rule-set. The current state or line of the automaton is than read from left to right and the matching notes of the selected pentatonic scale played (low notes left, high notes right). To give the user more control over the sound, the notes are split up into eight channels of differing pitch.		The synthesizer works like the following, the cellular automaton is simulated using the selected rule-set. The current state or line of the automaton is than read from left to right and the matching notes of the selected pentatonic scale played (low notes left, high notes right). To give the user more control over the sound, the notes are split up into eight channels of differing pitch.

	[[:File:~~One simulation step visualized~~ approach.png]]		[[:File:approach.png\|500px]]

			One simulation step visualized

	The synthesizer is web-based using HTML, CSS and JavaScript. To play notes the library Tone.js (js/tone.js)and their default synthesizer is used (js/synth.js). The simulation is visualized using the Canvas-Api and simulated using native JavaScript (js/automata.js). The User-Interface is written in HTML and CSS (index.html) using onclick-event handlers to interact with the simulation (js/gui.js).		The synthesizer is web-based using HTML, CSS and JavaScript. To play notes the library Tone.js (js/tone.js)and their default synthesizer is used (js/synth.js). The simulation is visualized using the Canvas-Api and simulated using native JavaScript (js/automata.js). The User-Interface is written in HTML and CSS (index.html) using onclick-event handlers to interact with the simulation (js/gui.js).

	[[:File:The final synthesizer-ui ~~finished.png]]~~		[[:File:finished.png\|500px]]

			The final synthesizer-ui

	===Further Reading:===		===Further Reading:===

Lalalolo: /* */

2019-03-21T22:38:13Z

← Older revision		Revision as of 22:38, 21 March 2019
Line 8:		Line 8:
	The so called Game of Life (or GoL in short) is a 'cellular automaton', a type of simulation that works on a regular grid of cells and in discrete time-steps. For every time-step a set of rules is enforced for every cell, determining it's state. In most cellular automaton there are only two states 'living' and 'dead'. Depending on the rules and other constrains of the simulation, complex patterns might occur and this project will try to take these patterns and represent them as notes in a 'cellular automaton synthesizer'.		The so called Game of Life (or GoL in short) is a 'cellular automaton', a type of simulation that works on a regular grid of cells and in discrete time-steps. For every time-step a set of rules is enforced for every cell, determining it's state. In most cellular automaton there are only two states 'living' and 'dead'. Depending on the rules and other constrains of the simulation, complex patterns might occur and this project will try to take these patterns and represent them as notes in a 'cellular automaton synthesizer'.

	[[File:dim.png]]		[[File:dim.png\|500px]]
	cellular automaton in different dimensions		cellular automaton in different dimensions

← Older revision		Revision as of 15:26, 5 June 2019
Line 67:		Line 67:
	===Further Reading:===		===Further Reading:===
	====Elementary Cellular Automaton====		====Elementary Cellular Automaton====
	http://mathworld.wolfram.com/ElementaryCellularAutomaton.html		* http://mathworld.wolfram.com/ElementaryCellularAutomaton.html
	http://atlas.wolfram.com/01/01/rulelist.html		* http://atlas.wolfram.com/01/01/rulelist.html
	https://plato.stanford.edu/entries/cellular-automata/supplement.html		* https://plato.stanford.edu/entries/cellular-automata/supplement.html

	====Pentatonic Scale====		====Pentatonic Scale====
	[[wikipedia:Pentatonic scale]]		* [[wikipedia:Pentatonic scale]]
	https://www.piano-keyboard-guide.com/pentatonic-scale.html		* https://www.piano-keyboard-guide.com/pentatonic-scale.html

	====Web Stuff====		====Web Stuff====
	https://developer.mozilla.org/de/docs/Web/API/Web_Audio_API		* https://developer.mozilla.org/de/docs/Web/API/Web_Audio_API
	https://developer.mozilla.org/de/docs/Web/HTML/Canvas		* https://developer.mozilla.org/de/docs/Web/HTML/Canvas
	https://tonejs.github.io/		* https://tonejs.github.io/

	===Downloads===		===Downloads===
	[[File:automata.zip]]		[[File:automata.zip]]
	Just open index.html with a modern browser		Just open index.html with a modern browser

← Older revision		Revision as of 15:25, 5 June 2019
Line 66:		Line 66:

	===Further Reading:===		===Further Reading:===
			====Elementary Cellular Automaton====
	Elementary Cellular Automaton:
	http://mathworld.wolfram.com/ElementaryCellularAutomaton.html		http://mathworld.wolfram.com/ElementaryCellularAutomaton.html
	http://atlas.wolfram.com/01/01/rulelist.html		http://atlas.wolfram.com/01/01/rulelist.html
	https://plato.stanford.edu/entries/cellular-automata/supplement.html		https://plato.stanford.edu/entries/cellular-automata/supplement.html

	Pentatonic Scale:		====Pentatonic Scale====
	~~https~~:~~//en.wikipedia.org/wiki/Pentatonic_scale~~		[[wikipedia:Pentatonic scale]]
	https://www.piano-keyboard-guide.com/pentatonic-scale.html		https://www.piano-keyboard-guide.com/pentatonic-scale.html

	Web Stuff:		====Web Stuff====
	https://developer.mozilla.org/de/docs/Web/API/Web_Audio_API		https://developer.mozilla.org/de/docs/Web/API/Web_Audio_API
	https://developer.mozilla.org/de/docs/Web/HTML/Canvas		https://developer.mozilla.org/de/docs/Web/HTML/Canvas