Universitą di Bologna

 

 

Corso: Fisica Superiore

 

Programma del Corso

Anno Accademico 2002-2003

Prof. Carlo Pellacani

 

Argomenti

 

Primo Semestre

 

1)      Complessitą: analisi del concetto di complessitą in fisica e matematica

a)      Introduzione al concetto di Complessitą Algoritmica

b)     Serie di dati casuali e statistica classica

c)      Complessitą di Kolmogorov- Chaitin

d)     Induzione e complessitą secondo Solomonof

e)      Complessitą ed algoritmi formali

 

2)      Complessitą Fisica

a)      Complessitą effettiva (Gell Mann- Lloyd)

b)     Profonditą Logica di un processo fisico

c)      Entropia e informazione in Fisica

d)     Demone di Maxwell e costo energetico dell’informazione

e)      Continuo ed informazione

 

 

Secondo Semestre

 

3)      Calcolatori e teorie fisiche

a)      Cenni sulla teoria degli automi

b)     Irriducibilitą di un sistema fisico ed implicazioni  teoriche

c)      Cenni sugli automi cellulari, reti neurali, reti booleane

d)     Algoritmi evolutivi

 

4)      Teorema di Godel e teorie fisiche

 

 

 

Testi Raccomandati:

 

1)      Ming Li & Paul Vitany: An Introuction to Kolmogorov Complexity an Its Applications, Springer, 1997.

2)      Michael Sipser: Introduction to the Theory of  Computation, PWS Pub. Comp., 1997

3)      Henning F. Harmuth: Information Theory Applied to Space-Time Physics, World Scientific, 1992

4)      Gregory J. Chaitin: The Limits of Mathematics, Springer, 1998

 

Bologna University

 

 

 

Course: Advanced Physics

 

Program

Academic Year 2002-2003

Prof. Carlo Pellacani

 

Subjects

 

Semester 1

 

1)      Complexity: analysis of the concept in physics and mathematics

a)      Algoritmic Complexity

b)     Random strings and statistics

c)      Kolmogorov-Chaitin complexity

d)     Induction and Solomonof complexity

e)      Complexity and formal systems

 

2)      Physical Complexity

a)      Effective Complexity (Gell-Mann & Lloyd)

b)     Logical depth

c)      Maxwell Demon and information theory

d)     Physical space and information theory

 

 

Semester 2

 

3)      Computers and Physical theories

a)      Introduction to automata theory

b)     Irriducibility and physical theories

c)      Cellular automata, neural networks and Boolean networks

d)     Evolutionary algorithms

 

4)      Godel Theorem and physical theories

 

 

Suggested Texts:

 

5)      Ming Li & Paul Vitany: An Introuction to Kolmogorov Complexity an Its Applications, Springer, 1997.

6)      Michael Sipser: Introduction to the Theory of  Computation, PWS Pub. Comp., 1997

7)      Henning F. Harmuth: Information Theory Applied to Space-Time Physics, World Scientific, 1992

8)      Gregory J. Chaitin: The Limits of Mathematics, Springer, 1998