Tootfinder

Opt-in global Mastodon full text search. Join the index!

No exact results. Similar results found.
@patrikja@functional.cafe
2025-10-18 06:03:51

Destination calculus: A linear λ-calculus for purely functional memory writes
Presented by Arnaud Spiwack. Joint work with Thomas Bagrel,
#icfpsplash25

First slide of "Destination calculus: A linear λ-calculus for purely functional memory writes"
Presented by Arnaud Spiwack
Destinations slide: Linear logic lets you talk about destinations as holes.
@arXiv_condmatstrel_bot@mastoxiv.page
2025-09-24 08:20:04

Origin of pressure-induced anomalies in the nodal-line ferrimagnet Mn$_3$Si$_2$Te$_6$
Varun Venkatasubramanian, Makoto Shimizu, Daniel Guterding, Harald O. Jeschke
arxiv.org/abs/2509.18238

@Techmeme@techhub.social
2025-12-20 07:35:55

A look at Meta's 2GW Hyperion data center in Louisiana, with the first phase opening in 2028; an analysis shows sales tax breaks on GPUs could total $3.3B (Jon Keegan/Sherwood News)
sherwood.news/tech/hyperion/

@arXiv_csLO_bot@mastoxiv.page
2025-10-15 08:57:32

Substitution Without Copy and Paste
Thorsten Altenkirch (University of Nottingham), Nathaniel Burke (Imperial College London), Philip Wadler (University of Edinburgh)
arxiv.org/abs/2510.12304

@cosmos4u@scicomm.xyz
2025-11-17 07:46:18

Is #AI really just dumb statistics? "Olympiad-level physics problem-solving presents a significant challenge for both humans and artificial intelligence (AI), as it requires a sophisticated integration of precise calculation, abstract reasoning, and a fundamental grasp of physical principles," says the (abstract of the) paper arxiv.org/abs/2511.10515: "The Chinese Physics Olympiad (CPhO), renowned for its complexity and depth, serves as an ideal and rigorous testbed for these advanced capabilities. In this paper, we introduce LOCA-R (LOgical Chain Augmentation for Reasoning), an improved version of the LOCA framework adapted for complex reasoning, and apply it to the CPhO 2025 theory examination. LOCA-R achieves a near-perfect score of 313 out of 320 points, solidly surpassing the highest-scoring human competitor and significantly outperforming all baseline methods." Oops ...?

@rigo@mamot.fr
2025-11-19 22:10:32

Il y a déjŠ des milliers de gens sans abri. En augmentant la taxe foncière tel qu'ils le font, les loyers vont mécaniquement augmenter. Et ainsi verser encre plus de gens dans la rue et faire obstacle Š toute rénovation. C'est un coup de génie du gouvernement!

@relcfp@mastodon.social
2025-12-18 16:06:52

Call for Essays for Anthology Under Contract: Shirley Jackson
ift.tt/CXlzZLE
updated: Wednesday, December 17, 2025 - 3:24pmfull name / name of organization: Joseph Michael…
via Input 4 RELCFP

@arXiv_mathOC_bot@mastoxiv.page
2025-10-15 09:45:32

Bilateral facial reduction: qualification-free subdifferential calculus and exact duality in convex analysis
Matthew S. Scott
arxiv.org/abs/2510.12244

@Techmeme@techhub.social
2025-11-09 12:01:22

Israel-based RAAAM, whose "GCRAM" on-chip memory tech aims to deliver up to 10x power savings relative to high-density SRAM, raised a $17M Series A led by NXP (Meir Orbach/CTech)
calcalistech.com/ctechnews/art

@patrikja@functional.cafe
2025-10-05 07:30:33

I just published a post on an interesting MSc thesis I supervised. Arvid Rydberg and Selina Sand Engberg took on the computational challenge of level-p-complexity (D_p(f)) of Boolean functions.
They optimised the algorithms using hash-consing & normalisation, and developed tools for exact calculations using algebraic numbers.
Details:

Figure 2.3: An illustration of a decision tree for computing maj_3 and
the polynomial for the level-p-complexity plotted in a graph.
Figure 5.1: A set of polynomials representing the level-p complexity for a 4-bit
Boolean function containing the three different types of critical point.
Front-page of the MSc thesis "Exploring level-p-complexity for subclasses of Boolean functions" at Chalmers and UGOT.