-
(Just FYI - I don’t think it is).
-
giovanna-henderson reblogged this from fyeahcomputersciencemajorpenguin
-
rbtos reblogged this from theitproblems
-
invalid-data reblogged this from theitproblems
-
theitproblems reblogged this from fyeahcomputersciencemajorpenguin
-
c-3pohshit reblogged this from fyeahcomputersciencemajorpenguin
-
astro73 reblogged this from fyeahcomputersciencemajorpenguin and added:
If you include the infinite memory requirement, no language is turing complete. If you ignore that, probably every...
-
s0ul-is-over liked this
-
s0ul-is-over reblogged this from fyeahcomputersciencemajorpenguin and added:
nope me neither, tape has to be infinite and if you can make an infinite memory construct in C, you’d probably be making...
-
wirthluce liked this
-
intothecontinuum liked this
-
noimawesome submitted this to fyeahcomputersciencemajorpenguin
-
