Trump’s funding cuts are unofficially halting government operations – The Washington Post

The hidden ways Trump, DOGE are shutting down parts of the U.S. government

Limits on spending have incapacitated parts of agencies as varied as the National Park Service and the Pentagon.

May 11, 2025 at 6:00 a.m. EDTYesterday at 6:00 a.m. EDT, 8 min

By Hannah Natanson and Maxine Joselow

At the Environmental Protection Agency, research at 11 laboratories has ground to a halt because the Trump administration has not approved most new lab purchases.

At the National Oceanic and Atmospheric Administration, key work on weather forecasting has slowed to a crawl because Commerce Secretary Howard Lutnick must sign off personally on many contracts and grants. And at the Social Security Administration, some employees are running out of paper, pens and printer toner because the U.S. DOGE Servicehas placed a $1 spending limit on government-issued credit cards. (DOGE stands for Department of Government Efficiency, though it is not a Cabinet-level agency.)

Across the federal government, Trump officials are halting a wide range of operations by declining to approve key funds. This unofficial hold on many activities has incapacitated many agencies’ divisions, even though they remain technically intact.

Read more: Trump’s funding cuts are unofficially halting government operations – The Washington Post

Source Links: Trump’s funding cuts are unofficially halting government operations – The Washington Post

#FundingCuts #GovernmentOperations #Halting #HiddenWays #ShuttingDown #TheWashingtonPost #Trump #UnitedStatesGovernment

New entry of AI-generated #comics and #jokes added to our #website:

#Halting #Foreign Aid

comics.lucentinian.com/3719
#LaughWithAI #DailyComedy #AIGeneratedJokes #VisitUsNow #Comedy

A Platonic Paradox
#John #Colarusso

I came into linguistics with two degrees in philosophy, in which discipline I had studied a fair bit of logic. Because of this background the theory of the #language #acquisition #device (LAD) as conceived by Chomsky at the time seemed flawed to me.

#Chomsky argued more or less that the #LAD was a sort of super grammar, one that took a language input (from parent to child) and formulated the rules (grammar) for that language on the basis of (super) grammatical rules.

While this seemed a reasonable position I knew that it could not work; Chomsky had stumbled into the #halting #problem.

Chomsky’s LAD was a device that matched grammatical rules to an input, in effect positing an “algorithm,” a coherent way of establishing a set of rules for a language “input.” One might frame it as a question,

(1):
QLAD: Does G, a grammar, applied to an utterance, U, have a derivation, Δ?

This may be put into a close association (an isomorphism, one for one match) with the “halting” question,

(2):
QW: Does M applied to a ‘M’ eventually stop on ‡?

Here M is a “Turing machine,” a formal mechanism than can calculate (derive) anything that can be derived by an algorithm, and ‘M’ is some string, some formal object that must be derived by some procedure (read “algorithm”). The diamond, ‡, is the “halting symbol,” signifying that M has in fact reached an end, that is, that it has in fact derived.

As Crossley et al. show this is an unsolvable problem

https://inference-review.com/letter/a-platonic-paradox

#371 – Max Tegmark: The Case for Halting AI Development https://triangleagency.co.uk/371-max-tegmark-the-case-for-halting-ai-development/?utm_source=dlvr.it&utm_medium=mastodon #TheTriangleAgencyNews #Case #Development #Halting

Types can grant unlimited recursion and hence termination. Does it solve #halting problem? It certainly creates a problem : massive memory leaks in #proofassistants

arithmetical hierarchy measures m definability of N
#Turing T degrees m level of uncomputability of N
set A is #Turing reducible to set B, if an #oracle o T machine, given an o for B, computes characteristic f( A) . T jump of a set A is a form of #Halting problem wrt to A.

- computing, concrete, precise information is in general not computable within finite time and memory (see )Rice's theorem and the #halting problem). #Abstraction is used to allow for generalized answers to questions