From 3fd26332e62db662e6e5c88e07aa25eb28598224 Mon Sep 17 00:00:00 2001 From: Akshay Date: Thu, 18 Jun 2020 10:53:42 +0530 Subject: spill straight fax --- docs/posts/turing_complete_type_systems/index.html | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'docs/posts') 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 @@ 18/06 — 2020
- 8.78 + 9.18 cm   - 0.8 + 0.9 min
@@ -45,7 +45,7 @@

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 f that determines if a program g, where g is written in a Turing complete programming language, will ever halt. The Halting Problem is in fact, an undecidable problem.

How is any of this relevant?

-

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 rustc may never finish compiling your Rust program!

+

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 rustc may never finish compiling your Rust program! I lied, rustc stops after a while, after hitting the recursion limit.

I understand that this post lacks content.

-- cgit v1.2.3