/prog/ - Fun fact — Tinychan BBS

Name: Anonymous 2017-10-09 18:05

Haskell is not even turing-complete without IO monad.

Name: Anonymous 2017-10-09 23:13

So?

Name: Anonymous 2017-10-10 9:14

>>1
Turing completeness is impure, heretic.

Name: Anonymous 2017-10-10 11:49

You can implement untyped lambda calculi without that (I think), thus it is turing complete.

Name: Anonymous 2017-10-10 12:02

>>4

(I think)

　　　　　　　　　　　 ノ´⌒｀ヽ
　　　　　　　　γ⌒´　　 　　 ＼　 　 　 
　　　　　　　.／／ ""´ ⌒＼　　）　　　 
　　　　　　　.i /　 ＼　　 ,＿ ｉ　）　 　 　 
　　　　　 　 i　　 (･ ）゛ ´( ･） i,/
　　　　　　　ｌ u　　 （__人_）.　 |　
　　　　　 ＿＼　　∩ノ ⊃　／　　　
　　　　　(　 ＼　／ ＿ノ　|　 |
　　　　　.＼　“　　／＿＿|　 |
　　　　　　　＼ ／＿＿＿ ／

Name: Anonymous 2017-10-10 14:58

Turing machines don't even consider that the tape could be changed by an external event.

Name: Anonymous 2017-10-11 11:00

>>5
⠀⠰⡿⠿⠛⠛⠻⠿⣷
⠀⠀⠀⠀⠀⠀⣀⣄⡀⠀⠀⠀⠀⢀⣀⣀⣤⣄⣀⡀
⠀⠀⠀⠀⠀⢸⣿⣿⣷⠀⠀⠀⠀⠛⠛⣿⣿⣿⡛⠿⠷
⠀⠀⠀⠀⠀⠘⠿⠿⠋⠀⠀⠀⠀⠀⠀⣿⣿⣿⠇
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠉⠁
⠀⠀⠀⠀⣿⣷⣄⠀⢶⣶⣷⣶⣶⣤⣀
⠀⠀⠀⠀⣿⣿⣿⠀⠀⠀⠀⠀⠈⠙⠻⠗
⠀⠀⠀⣰⣿⣿⣿⠀⠀⠀⠀⢀⣀⣠⣤⣴⣶⡄
⠀⣠⣾⣿⣿⣿⣥⣶⣶⣿⣿⣿⣿⣿⠿⠿⠛⠃
⢰⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡄
⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡁
⠈⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠁
⠀⠀⠛⢿⣿⣿⣿⣿⣿⣿⡿⠟
⠀⠀⠀⠀⠀⠉⠉⠉

Name: Anonymous 2017-10-11 11:42

>>7
really makes u think ....

Name: Anonymous 2017-10-12 20:28

https://raw.githubusercontent.com/Capaverde/XBF/master/765px-Von_Neumann_Architecture.svg.png

Name: !Ps1ivhrO6w 2017-10-12 23:58

Something about detachable pieces which you can reason about.

Name: Anonymous 2017-10-13 0:38

U MENA HASKAL

Fun fact

1 Name: Anonymous 2017-10-09 18:05

2 Name: Anonymous 2017-10-09 23:13

3 Name: Anonymous 2017-10-10 9:14

4 Name: Anonymous 2017-10-10 11:49

5 Name: Anonymous 2017-10-10 12:02

6 Name: Anonymous 2017-10-10 14:58

7 Name: Anonymous 2017-10-11 11:00

8 Name: Anonymous 2017-10-11 11:42

9 Name: Anonymous 2017-10-12 20:28

10 Name: !Ps1ivhrO6w 2017-10-12 23:58

11 Name: Anonymous 2017-10-13 0:38