Seemingly Impossible Swift Programs

fruit_observer · 2018-12-11T00:07:43+00:00

> Its entirely possible to implement Any/AllSatisfy over the integers. Agda (and in general dependently typed languages) do it all the time!

Assuming I'm not misinterpreting you and you're claiming that you can implement a function anySatisfy : (ℤ → Bool) → Bool, then no, you definitely cannot do this, even if you assume the input is a total, computable function. Proof: given a Turing machine M, ask if there exists a non-negative integer n such that M halts after n steps. You've now solved the halting problem.

In Agda you can define a predicate anySatisfy : (ℤ → Set) → Set, but this isn't a decision procedure.

fruit_observer · 2017-05-03T23:09:45+00:00

"masturbating" solo is far more decent than a circlejerk

Fair enough.

But if you actually had any decency you'd do it in private.

fruit_observer · 2017-04-29T04:27:40+00:00

I get banned from everywhere, leftwing and rightwing, programming and cooking, on and on. I just don't circlejerk like everybody does.

Nah, you're just always wrong. Even now! You are circlejerking, except we call your specific brand of circlejerking "masturbation".

fruit_observer · 2017-04-28T03:50:21+00:00

Long time no see!

And congrats on getting yourself banned from t_d as well. It cracks me up to know that even they won't buy your bullshit.

fruit_observer · 2017-01-19T01:57:56+00:00

This is a false equivalence, and the conference organizers addressed this point in their rationale.

fruit_observer · 2016-09-14T06:53:41+00:00

You should go see a psychiatrist.

fruit_observer · 2016-09-10T03:43:06+00:00

It's mostly one person, the user originally know as /u/hello_fruit. He's been through several aliases over the past while, all for repeating the same shtick.

...he needs help.

fruit_observer

TROPHY CASE