neatchee

And you didn’t read the article. He wasn’t setting up a booth. He was a featured speaker.

Official US room? You don’t even understand the story. “The US House, Davos” is a location, a venue, where the Fortune Global Leadership Dinner is being held.

I’m not sure how you can look at someone being blocked from speaking to an international audience of world and business leaders - not because nobody is interested, but for political reasons - and not see that as an international issue, regardless of who the involved parties are.

An international organization: We want this person to speak

The international audience: We have come here, expecting that this person will be speaking in this place and at this time

The International press: We cover this international event every year, where this person will be speaking

A US Politician: We have pressured management so that this person cannot speak here because we don’t like what they have to say

You: This is an internal US issue

Like… what?

I get that you may not give a shit about what Gavin Newsom has to say but clearly that international audience, the organizers, and others did. And they were denied that opportunity. That’s international news whether you care about it or not

Silencing dissenting voices at an international venue from a notable and experienced politician is an international issue. International access to American political voices, especially those on disagreement with the current leadership, is an important thing for world, and international business leaders to hear, which is exactly what the Fortune Magazine dinner event he was denied entry to is about.

Look at this another way…rather than “American governor wasn’t allowed to speak to international audience”, it is equally “international audience not allowed to hear from American governor”

Logically terminating resources does not imply a terminating logic loop. Clever wordplay, though.

Recursion has a specific definition. It means solving a problem by breaking a process down into smaller and smaller self-similar pieces until reaching the “base case”. In programming, it (almost) always means a function that calls itself as part of its internal logic. Depending on what the function does and the conditions for returning a value from the function, it may do that one time, many times, or not at all. A classic example is the Boggle solver.

I did say I was being pedantic :P

Not to be pedantic, and I do appreciate the humor, but that’s not recursion either :3 Recursion doesn’t need to be endless. Recursive functions can absolutely have logical termination.