aeris22’s avataraeris22’s Twitter Archive—№ 83,696

  1. …in reply to @stmanfr
    @stmanfr This is equivalent. Stritcly equivalent. This is mathematically proved.
    1. …in reply to @aeris22
      @stmanfr The only assumption for that is finished memory. And this is the case in practice for computers.
      1. …in reply to @aeris22
        @stmanfr Mathematically, Turing machine with finished memory = finished state machine with memory tape = lambda calculus with well formed expression