Conversation

Notices

1. Embed this notice
   screwlisp (screwtape@mastodon.sdf.org)'s status on Monday, 25-Nov-2024 04:26:34 JST screwlisp

   in reply to

   • fl

   @fl I mean, why do we always describe algebra in terms of fortran?

   • Embed this notice
     fl (fl@mathstodon.xyz)'s status on Monday, 25-Nov-2024 04:26:35 JST fl

     Why Turing's machine are the universal basis for computers while the mathematicians have described several alternate models of effective computability : lambda calculus, general recursive functions, etc. Does it mean that in a certain way Turing's machines are more fundamental ? (While we know that they are just as potent as the other models.)