LogFAQs > #958442383

IllegalAlien posted...

I mean, if that's what you define computation as then sure... but then you wouldn't even need 2 states to do that :) just define f(x) = x for all inputs

I think this is a good representation of the argument:
https://medium.com/the-spike/yes-the-brain-is-a-computer-11f630cad736

To summarize the formal definitions:
(1) an algorithm is anything a Turing machine can do,
(2) computable functions are defined as those functions that we have algorithms for,
(3) a computer is anything which physically implements algorithms in order to solve computable functions.

Main discrepancy here is that a computer does not need to be turing complete.

---

Stabilized. COVxy alt.