Talk:Try to Take

I dont really see how this could be uncomptable, a monus series seems perfectly computable, and as it is the sole operator, it should be computable. --Yayimhere2(school) (talk) 12:13, 18 December 2025 (UTC)

Say you have an expression $f(x)$ that runs a Turing machine for $x$ steps and returns 0 if it hasn't halted yet and 1 if it has. If you take $1\ {\underset {x}{M}}\ f(x)$, then the monuseries acts as a halting oracle. The monuseries is equal to 1 if the Turing machine never halts, but if $f(x)$ ever returns 1 (i.e. the Turing machine halts), the monuseries is equal to 0. This means that even though both the left side ($1$) and the right side ($f(x)$) are computable, the monuseries isn't. –PkmnQ (talk) 14:34, 18 December 2025 (UTC)

But *why*- like, I could program in a monuseries in almost any language? I dont rlly get it to be honest --Yayimhere2(school) (talk) 15:00, 18 December 2025 (UTC)

Well, here's my best attempt at one in Python.

import itertools
def monuseries(left, right):
    for x in itertools.count(0):
        left -= right(x)
        if left <= 0:
            return 0

It can only successfully calculate monuseries that reach 0 at some point. If the monuseries never reaches 0, the function will loop forever waiting for it to. That's where you start needing the halting oracle. –PkmnQ (talk) 22:41, 18 December 2025 (UTC)

The article never seemed to imply it was reduced even if it looped forever, which is confusing --Yayimhere2(school) (talk) 04:58, 19 December 2025 (UTC)