diff options
author | Akshay <[email protected]> | 2020-06-18 06:23:42 +0100 |
---|---|---|
committer | Akshay <[email protected]> | 2020-06-18 06:23:42 +0100 |
commit | 3fd26332e62db662e6e5c88e07aa25eb28598224 (patch) | |
tree | cea96f0f13000cfe61c73653853102fdf316d3ed /docs/posts | |
parent | ac21eab7ee1a6c81101bd4337c39eee41d292dfd (diff) |
spill straight fax
Diffstat (limited to 'docs/posts')
-rw-r--r-- | docs/posts/turing_complete_type_systems/index.html | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/docs/posts/turing_complete_type_systems/index.html b/docs/posts/turing_complete_type_systems/index.html index 4a7e2b1..3e572e3 100644 --- a/docs/posts/turing_complete_type_systems/index.html +++ b/docs/posts/turing_complete_type_systems/index.html | |||
@@ -24,12 +24,12 @@ | |||
24 | 18/06 — 2020 | 24 | 18/06 — 2020 |
25 | <div class="stats"> | 25 | <div class="stats"> |
26 | <span class="stats-number"> | 26 | <span class="stats-number"> |
27 | 8.78 | 27 | 9.18 |
28 | </span> | 28 | </span> |
29 | <span class="stats-unit">cm</span> | 29 | <span class="stats-unit">cm</span> |
30 |   | 30 |   |
31 | <span class="stats-number"> | 31 | <span class="stats-number"> |
32 | 0.8 | 32 | 0.9 |
33 | </span> | 33 | </span> |
34 | <span class="stats-unit">min</span> | 34 | <span class="stats-unit">min</span> |
35 | </div> | 35 | </div> |
@@ -45,7 +45,7 @@ | |||
45 | </ul> | 45 | </ul> |
46 | <p>It is impossible to determine if a program written in a generally Turing complete system will ever stop. That is, it is impossible to write a program <code>f</code> that determines if a program <code>g</code>, where <code>g</code> is written in a Turing complete programming language, will ever halt. The <a href="https://en.wikipedia.org/wiki/Halting_problem">Halting Problem</a> is in fact, an <a href="https://en.wikipedia.org/wiki/Undecidable_problem">undecidable problem</a>.</p> | 46 | <p>It is impossible to determine if a program written in a generally Turing complete system will ever stop. That is, it is impossible to write a program <code>f</code> that determines if a program <code>g</code>, where <code>g</code> is written in a Turing complete programming language, will ever halt. The <a href="https://en.wikipedia.org/wiki/Halting_problem">Halting Problem</a> is in fact, an <a href="https://en.wikipedia.org/wiki/Undecidable_problem">undecidable problem</a>.</p> |
47 | <p><em>How is any of this relevant?</em></p> | 47 | <p><em>How is any of this relevant?</em></p> |
48 | <p>Rust performs compile-time type inference. The type checker, in turn, compiles and infers types, I would describe it as a compiler inside a compiler. It is possible that <code>rustc</code> may never finish compiling your Rust program!</p> | 48 | <p>Rust performs compile-time type inference. The type checker, in turn, compiles and infers types, I would describe it as a compiler inside a compiler. It is possible that <code>rustc</code> may never finish compiling your Rust program! I lied, <code>rustc</code> stops after a while, after hitting the recursion limit.</p> |
49 | <p>I understand that this post lacks content.</p> | 49 | <p>I understand that this post lacks content.</p> |
50 | 50 | ||
51 | </div> | 51 | </div> |