...some examples of implementation (in Csouund) of the main algorithms used in algorithmic composition:

1. LONG RUN PROBABILITY AND DISTRIBUTION MODELS

2. DETERMINISTIC ALGORITHMS (RULE-BASED ALGORITHMS):

• FIBONACCI SEQUENCE
• COLLATZ CONJECTURE
• RECAMAN'S SEQUENCE

1. PROBABILISTIC ALGORITHMS:

• MARKOV CHAIN
• MONTE CARLO METHOD ---> METROPOLIS AND METROPOLIS HASTINGS
• RANDOM WALK
• RANDOM WALK - LEVY FLIGHT

1. FRACTALS:

• TRIANGLE, CARPET AND CURVE OF SIERPINSKY
• ESCAPE-TIME FRACTALS
• FRACTAL TREE

1. NONLINEAR DYNAMIC SYSTEMS:

• LOGISTIC MAP
• STANDARD MAP
• HENON ATTRACTOR/MAP
• LORENZ ATTRACTOR
• ROSSLER ATTRACTOR

1. GENERATIVE GRAMS:

• L-SYSTEM

1. PATHFINDER

• A* SEARCH ALGORITHM

1. CELLULAR AUTOMATA

• ELEMENTARY CELLULAR AUTOMATA (WOLFRAM CODE)
• CONWAY'S GAME OF LIFE

for any questions: mnlpql@gmail.com ©PasqualeMainolfi