Trump exempts smartphones and computers from new tariffs
US President Donald Trump's administration has exempted smartphones and computers from reciprocal tariffs, including the 125% levies imposed on Chinese imports. The move comes after concerns from US tech companies that the price of gadgets could skyrocket, as many of them are made in China. The exemptions also include other electronic devices and components, including semiconductors, solar cells and memory cards.
Some estimates suggested iPhone prices and other electronic goods in the US would have gone up three times if the costs of the tariffs had been passed on to consumers. Trump's move takes off "a huge black cloud overhang for now over the tech sector and the pressure facing U.S. Big Tech", said Wedbush analyst Dan Ives in a research note, according to the Associated Press.
The US is a major market for iPhones, while Apple accounted for more than half of its smartphones sales last year, according to Counterpoint Research. It says as much as 80% of Apple's iPhones intended for US sale are made in China, with the remaining 20% made in India. Along with fellow smartphone giants such as Samsung, Apple has been trying to diversify its supply chains to avoid over-reliance on China in recent years. India and Vietnam emerged as frontrunners for additional manufacturing hubs. As tariffs took effect, Apple reportedly looked to speed up and increase its production of India-produced devices in recent days.
Lot of sound and fury, but it seems at the end of the day nothing will happen. Over/under on how many more 'exemptions' we'll end up with?
Both those things were motivated by angry Palestinian refugees wanting to fight Israel while their host countries weren't so keen. One reason this whole situation is such a mess is that King Abdullah annexed the West Bank which was supposed to be the core of the new Palestinian state, which also happened to make Palestinians a majority of the Jordanian population. Obviously the Palestinians were more keen on attacking Israel than Jordan, especially post-67.
As for Lebanon, Israel set up a false flag terror group attempting to provoke the PLO into war during a ceasefire. They also attempted to assassinate the American ambassador to Lebanon.
Isn't that only supposed to work if your home country refuses to accept you or you refuse to say where you come from?
That is, you either deny the main principle of democracy
Democracy is a system of government, not a scientific method.
I kinda respect it doubling down, but it's scrambling to cover its ass. Also, I noticed it forgot the "mod 2n" part of c_i, which also throws a wrench into things.
For the first calculation dump at least, it comes up with a value 6.63 × 10⁸ s^-1, then compares it to the expected value from the NIST Atomic Spectra Database 1.6725 × 10⁸ s⁻¹, then spends half the page trying to reconcile the difference, before giving up and proceeding with the ASD value.
Hmm, it's maybe coming close to something that works, but seems to fuck up at the important junctures. After a couple of paragraphs where it doesn't find anything useful, in paragraph 7 it concludes that we can break down n^(k - i - 1) into q*2^(i+1) + r_i, where r_i = n^(k - i - 1) mod 2^(i+1). But then later it declares that r_i = n^(k - i - 1) and the proof follows from there. Unfortunately I don't think this would get any points, although maybe it could figure something out if you keep telling it where it fucks up.
The correct answer is about 5.98 ns when applying the spontaneous emission formula, so Gemini pro 2.5 got it correct, although it had to reference NIST when its original formula didn't work. It looks like it copies the correct formula so I'm not sure where the erroneous factor of 4 comes from.
I just used the free public facing ones (Gemini 2.0 flash, GPT 4-o). You can try asking it for the decay time for the 3p-1s transition in hydrogen. It can do the 2p-1s transition since this question is answered in lots of places but struggles to extrapolate.
Proof or Bluff? Evaluating LLMs on 2025 USA Math Olympiad
Abstract: Recent math benchmarks for large language models (LLMs) such as MathArena indicate that state-of-the-art reasoning models achieve impressive performance on mathematical competitions like AIME, with the leading model, o3-mini, achieving scores comparable to top human competitors. However, these benchmarks evaluate models solely based on final numerical answers, neglecting rigorous reasoning and proof generation which are essential for real-world mathematical tasks. To address this, we introduce the first comprehensive evaluation of full-solution reasoning for challenging mathematical problems. Using expert human annotators, we evaluated several state-of-the-art reasoning models on the six problems from the 2025 USAMO within hours of their release. Our results reveal that all tested models struggled significantly, achieving less than 5% on average. Through detailed analysis of reasoning traces, we identify the most common failure modes and find several unwanted artifacts arising from the optimization strategies employed during model training. Overall, our results suggest that current LLMs are inadequate for rigorous mathematical reasoning tasks, highlighting the need for substantial improvements in reasoning and proof generation capabilities.
Background: The 'official' American competitive high school math circuit has several levels, progressing from AMC 10/12 (25 question, multiple choice, 75 minutes total) to AIME (15 questions, 3 hours, answers are in the form of positive 3 digit integers) to USAMO (2 days, 6 proof-based questions total, 3 questions with 4.5 hours per day), with difficulty increasing commensurate with the decrease in # of questions. While most AIME questions can be ground out using a standard set of high school/introductory college level math knowledge and tricks, the USAMO requires more depth of understanding and specialized techniques. For example, problem 1 (theoretically, the easiest) is as follows:
Let k and d be positive integers. Prove that there exists a positive integer N such that for every odd integer n > N , the digits in the base-2n representation of n^k are all greater than d.
This problem can be solved fairly simply using induction on k.
I've also noticed this when plugging grad-level QM questions into Gemini/ChatGPT. No matter how many times I tell it that it's wrong, it will repeatedly apologize and make the same mistake, usually copied from some online textbook or solution set without being able to adapt the previous solution to the new context.
- Prev
- Next

Deporting him is one thing, but sending him straight to the gangster's prison for the worst people imaginable because he wore a chicago bulls hat is a bit much. They should at least ask Bukele to let him out.
More options
Context Copy link