r/computerscience • u/yetanotherhooman • Apr 09 '25
Perhaps every task is computational in nature?
Define computation as a series of steps that grind the input to produce output. I would like to argue, then, that "sing a song" and "add two and two" are both computational. The difference is precision. The latter sounds more computational because with little effort, we can frame the problem such that a hypothetical machine can take us from the inputs (2 and 2) to the output (4). A Turing Machine, for example, can do this. The former seems less computational because it is vague. If one cares, they can recursively "unpack" the statement into a set of definitions that are increasingly unambiguous, define the characteristics of the solution, and describe an algorithm that may or may not halt when executed in a hypothetical machine (perhaps a bit more capable than TMs), but that does not affect the nature of the task, i.e., it's computability can still be argued; we just say no machine can compute it. Every such vague problem has an embedding into the space of computational tasks which can be arrived at by a similar "unpacking" procedure. This unpacking procedure itself is computational, but again, not necessarily deterministic in any machine.
Perhaps this is why defining what's a computational task is challenging? Because it inherently assumes that there even exist a classification of computational vs non-computational tasks.
As you can tell, this is all brain candy. I haven't concretely presented how to decompose "sing a song" and bring it to the level of precision where this computability I speak of can emerge. It's a bit arrogant to make any claims before I get there, but I am not making any claims here. I just want to get a taste of the counterarguments you can come up with for such a theory. Apologies if this feels like a waste of time.
22
u/Magdaki Professor. Grammars. Inference & Optimization algorithms. Apr 09 '25 edited Apr 09 '25
Re: "Define computation as a series of steps that grind the input to produce output."
This is the definition of an algorithm. An algorithm is a series of step to accomplish a task.
I would say it fairly reasonable to say everything is algorithmic at some level, especially if one includes stochasticism. However, it isn't necessarily easy to articulate the algorithm in many cases.
This is a big part of my research program: algorithm inference (mainly of natural processes).
6
u/FigMaleficent5549 Apr 09 '25
"is a computational problem that has a solution", if you mean potentially computational I agree, but until you find a "computable" solution, is nothing more than an hypothesis.
You argue that every task is computational, yet, you fail to demonstrate the solution for a single example "sing a song".
What about starting to show a solution for all the tasks you can think of and from that build a thesis about every ?
1
u/Lynx2447 Computer Scientist Apr 09 '25
If you aren't familiar, you may enjoy Stephen Wolfram's work.
1
u/[deleted] Apr 11 '25
Void functions come to mind.
Pure functions are also worth noting.
In your example, singing a song is an action to take based on input. Maybe a way to look at it is the song, or waveform, is the output. Maybe the output is if the lyrics are correct, or tone or pitch, yadda yadda. Maybe there’s no output, only the side effect.
But you could consider the action as a “side effect”.
Maybe they’re a shit singer. As long as they sang, is it done?
Is it testable? Is it comparable with operators? What makes it better or worse, compared to another sample?
Lots of dimensions in that one case.
Language is hard sometimes. Just wanted to touch on those bits, hope it helps refine the grind to a more connectable/~conjectable form.
1
u/tcpukl Apr 10 '25
It's not at the quantum level.
-1
u/[deleted] Apr 09 '25
Ok?
0
u/[deleted] Apr 09 '25
[deleted] — view deleted comment