-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcomplexity.html
36 lines (30 loc) · 1.31 KB
/
complexity.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
<!DOCTYPE html>
<html lang="en">
<head>
<title>Arghya Dutta</title>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1, shrink-to-fit=no">
<link rel="apple-touch-icon" sizes="180x180" href="../assets/favicon_io/apple-touch-icon.png">
<link rel="icon" type="image/png" sizes="32x32" href="../assets/favicon_io/favicon-32x32.png">
<link rel="icon" type="image/png" sizes="16x16" href="../assets/favicon_io/favicon-16x16.png">
<link rel="manifest" href="../assets/favicon_io/site.webmanifest">
<link rel="stylesheet" href="../assets/style.css">
</head>
<em><a href="../notebooks.html">Notebooks</a></em>
<h1>Complexity</h1>
<h2>Recommended</h2>
<dl>
<dt>
Mitchell, M. (2009). <em>Complexity: A guided tour</em>. Oxford University Press.
</dt>
<dt>
Bianconi, G. et al. (2023). <em>Complex systems in the spotlight: Next steps after the 2021 Nobel Prize in Physics</em>. <a href="https://doi.org/10.1088/2632-072X/ac7f75">Journal of Physics: Complexity, 4(1), 010201</a>.
</dt>
</dl>
<h2>If I get time</h2>
<dl>
<dt>Crutchfield, J. P., & Young, K. (1989). <em>Inferring statistical complexity</em>. <a href="https://doi.org/10.1103/PhysRevLett.63.105">Physical Review Letters, 63(2), 105–108</a>.
</dt>
</dl>
</body>
</html>