Skip to content

Commit

Permalink
😊 Updated readme.
Browse files Browse the repository at this point in the history 
Compiler is between languages.
  • Loading branch information
@rentruewang
rentruewang committed Jul 3, 2024
1 parent 0e96d1e commit d130406
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -54,7 +54,7 @@ and [Turing Completeness](https://en.wikipedia.org/wiki/Turing_completeness)

> A set of natural numbers is said to be a computable set (also called a decidable, recursive, or Turing computable set) if there is a Turing machine that, given a number n, halts with output 1 if n is in the set and halts with output 0 if n is not in the set.
With all these information, one can conclude that anything that is computable must be able to be compiled (transformed) to an algorithm running on a Turing machine.
With all these information, one can conclude that anything that is computable must be able to be compiled (transformed) to an algorithm running on a Turing machine, where compiling means transforming between different langauge / instruction set.

Csondiering that

Expand Down

0 comments on commit d130406

Please sign in to comment.