Archives: [ cm / sci / v / y ]
  • /sci/ - Science & Math
    • Index
    • Archives
    • /cm/ - Cute/Male
    • /sci/ - Science & Math
    • /v/ - Video Games (Archive)
    • /y/ - Yaoi
  • Index
    • By Post
    • By Thread
  • Ghost
  • Gallery
Your latest searches
  • /sci/: [image] 3fYZLOYRwJ7Im_zHTO2afw
  • /sci/: [image] oKlHXIXc0JLd_cBcInI1Aw
  • /sci/: [image] hfPY2qsQ5rsIw_yinPPCPg
  • /sci/: [image] kIGU6DObFXgxnAzogcwKcA
  • /sci/: [image] 5cjf49suZ9FfmWMkRhhe3Q
Capcode
Show Posts
Deleted Posts
Ghost Posts
Post Type
Results
Order
84KiB, 478x358, 1596045427179.gif
View SameGoogleiqdbSauceNAO
Anonymous Thu 13 Aug 11:17:16 2020 No.12003895 ViewReplyOriginalReport
Quoted By:
Is it possible to prove that a Turing machine is using the smallest possible set of tape alphabet symbols to solve a problem?
×

FoolFuuka Imageboard 2.2.0 - Asagi Fetcher
Change Theme
  • Fuuka
  • FoolFuuka - Default
  • FoolFuuka - Midnight
  • Yotsubatwo - Yotsuba
  • Yotsubatwo - Yotsuba B
Change Language
  • English
  • French
  • Italian
  • Portuguese
  • Add a Translation
Please use the report function for reporting posts. All other inquiries contact: admin@fireden.net