Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.physics.relativity > #667597 > unrolled thread
| Started by | Mild Shock <janburse@fastmail.fm> |
|---|---|
| First post | 2025-11-30 13:38 +0100 |
| Last post | 2025-12-04 12:59 +0800 |
| Articles | 20 on this page of 184 — 27 participants |
Back to article view | Back to sci.physics.relativity
Could AlphaEvolve find the sixth busy beaver ? Mild Shock <janburse@fastmail.fm> - 2025-11-30 13:38 +0100
An old Busy Beaver ASIC (Application-Specific Integrated Circuit) (Was: Could AlphaEvolve find the sixth busy beaver ?) Mild Shock <janburse@fastmail.fm> - 2025-11-30 13:54 +0100
An old Busy Beaver ASIC (Application-Specific Integrated Circuit) (Was: Could AlphaEvolve find the sixth busy beaver ?) Mild Shock <janburse@fastmail.fm> - 2025-11-30 13:55 +0100
What is analog computing nowadays? (Re: An old Busy Beaver ASIC (Application-Specific Integrated Circuit) (Was: Could AlphaEvolve find the sixth busy beaver ?) Mild Shock <janburse@fastmail.fm> - 2025-12-01 11:25 +0100
Wake-up call until everybody gets ear-bleeding (Re: What is analog computing nowadays?) Mild Shock <janburse@fastmail.fm> - 2025-12-01 12:01 +0100
BB(745) is independent of ZFC (Was: Wake-up call until everybody gets ear-bleeding) Mild Shock <janburse@fastmail.fm> - 2025-12-01 12:07 +0100
Write ZFC formulas on a tape (of a Turing machine) (Re: BB(745) is independent of ZFC ) Mild Shock <janburse@fastmail.fm> - 2025-12-02 17:18 +0100
Turing machines have neurons (Re: Write ZFC formulas on a tape (of a Turing machine)) Mild Shock <janburse@fastmail.fm> - 2025-12-02 17:19 +0100
A logical calculus in nervous activity [McCulloch & Pitts 1943] (Re: Turing machines have neurons) Mild Shock <janburse@fastmail.fm> - 2025-12-02 17:20 +0100
Busy Beaver and Theory Consistency (Was: A logical calculus in nervous activity [McCulloch & Pitts 1943]) Mild Shock <janburse@fastmail.fm> - 2025-12-02 17:39 +0100
Busy Beaver and Theory Consistency (Was: A logical calculus in nervous activity [McCulloch & Pitts 1943]) Mild Shock <janburse@fastmail.fm> - 2025-12-02 17:43 +0100
Re: Busy Beaver and Theory Consistency (Was: A logical calculus in nervous activity [McCulloch & Pitts 1943]) Mild Shock <janburse@fastmail.fm> - 2025-12-02 23:18 +0100
Re: What is analog computing nowadays? (Re: An old Busy Beaver ASIC (Application-Specific Integrated Circuit) (Was: Could AlphaEvolve find the sixth busy beaver ?) Maciej Woźniak <mlwozniak@wp.pl> - 2025-12-01 12:09 +0100
parallel random-access machine (parallel RAM or PRAM (Was: What is analog computing nowadays?) Mild Shock <janburse@fastmail.fm> - 2025-12-01 12:15 +0100
Re: parallel random-access machine (parallel RAM or PRAM (Was: What is analog computing nowadays?) Maciej Woźniak <mlwozniak@wp.pl> - 2025-12-01 13:23 +0100
Nope, you can't, because of the CRCW instuction (Was: parallel random-access machine) Mild Shock <janburse@fastmail.fm> - 2025-12-01 17:12 +0100
Algorithm introduced in Hogwild! SGD (Niu et al., 2011) (Was: Nope, you can't, because of the CRCW instuction) Mild Shock <janburse@fastmail.fm> - 2025-12-01 17:31 +0100
PRAMs might be closer to physics: Boltzman machines, etc.. (Was: Algorithm introduced in Hogwild! SGD) Mild Shock <janburse@fastmail.fm> - 2025-12-01 18:02 +0100
Re: Nope, you can't, because of the CRCW instuction (Was: parallel random-access machine) Maciej Woźniak <mlwozniak@wp.pl> - 2025-12-01 17:59 +0100
PRAMs might be closer to physics: Boltzman machines, etc.. (Re: Nope, you can't, because of the CRCW instuction) Mild Shock <janburse@fastmail.fm> - 2025-12-01 18:05 +0100
PRAMs might be closer to physics: Boltzman machines, etc.. (Re: Nope, you can't, because of the CRCW instuction) Mild Shock <janburse@fastmail.fm> - 2025-12-01 18:08 +0100
Physics more difficult than Rasperry LED cube? (Was: PRAMs might be closer to physics: Boltzman machines, etc..) Mild Shock <janburse@fastmail.fm> - 2025-12-01 18:25 +0100
Re: parallel random-access machine (parallel RAM or PRAM (Was: What is analog computing nowadays?) Thomas Heger <ttt_heg@web.de> - 2025-12-03 07:17 +0100
Re: parallel random-access machine (parallel RAM or PRAM (Was: What is analog computing nowadays?) Python <python@cccp.invalid> - 2025-12-03 06:46 +0000
Re: parallel random-access machine (parallel RAM or PRAM) Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-03 08:02 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Thomas Heger <ttt_heg@web.de> - 2025-12-04 07:50 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-12-04 09:57 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Telly Missiakos <siy@ioet.gr> - 2025-12-05 14:26 +0000
Re: parallel random-access machine (parallel RAM or PRAM) Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-06 17:02 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Thomas Heger <ttt_heg@web.de> - 2025-12-07 10:22 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-07 10:39 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-07 10:46 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-12-07 11:42 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Michael S <already5chosen@yahoo.com> - 2025-12-07 16:26 +0200
Re: parallel random-access machine (parallel RAM or PRAM) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-12-08 04:25 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-08 08:51 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Michael S <already5chosen@yahoo.com> - 2025-12-08 13:58 +0200
Re: parallel random-access machine (parallel RAM or PRAM) Thomas Heger <ttt_heg@web.de> - 2025-12-09 09:15 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Thomas Heger <ttt_heg@web.de> - 2025-12-08 08:21 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-12-08 09:06 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Thomas Heger <ttt_heg@web.de> - 2025-12-09 09:19 +0100
Re: parallel random-access machine (parallel RAM or PRAM) The Starmaker <starmaker@ix.netcom.com> - 2025-12-09 11:43 -0800
Re: parallel random-access machine (parallel RAM or PRAM) Thomas Heger <ttt_heg@web.de> - 2025-12-10 08:19 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-10 09:56 +0100
Re: parallel random-access machine (parallel RAM or PRAM) The Starmaker <starmaker@ix.netcom.com> - 2025-12-10 10:01 -0800
Re: parallel random-access machine (parallel RAM or PRAM) Thomas Heger <ttt_heg@web.de> - 2025-12-11 09:02 +0100
Re: parallel random-access machine (parallel RAM or PRAM) The Starmaker <starmaker@ix.netcom.com> - 2025-12-11 08:48 -0800
Re: parallel random-access machine (parallel RAM or PRAM) Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-12 01:58 +0100
Re: parallel random-access machine (parallel RAM or PRAM) The Starmaker <starmaker@ix.netcom.com> - 2025-12-11 20:45 -0800
Re: parallel random-access machine (parallel RAM or PRAM) The Starmaker <starmaker@ix.netcom.com> - 2025-12-11 23:07 -0800
Re: parallel random-access machine (parallel RAM or PRAM) The Starmaker <starmaker@ix.netcom.com> - 2025-12-12 00:49 -0800
Re: parallel random-access machine (parallel RAM or PRAM) "Paul.B.Andersen" <relativity@paulba.no> - 2025-12-14 14:27 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Yunior Molokanov <ukan@amuyao.ru> - 2025-12-14 17:18 +0000
Re: parallel random-access machine (parallel RAM or PRAM) Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-14 10:03 -0800
Re: parallel random-access machine (parallel RAM or PRAM) Salvado Gorbikov <abdrvvg@lgadi.ru> - 2025-12-15 22:01 +0000
Re: parallel random-access machine (parallel RAM or PRAM) The Starmaker <starmaker@ix.netcom.com> - 2025-12-14 10:25 -0800
Re: parallel random-access machine (parallel RAM or PRAM) "Paul.B.Andersen" <relativity@paulba.no> - 2025-12-14 21:22 +0100
Re: parallel random-access machine (parallel RAM or PRAM) The Starmaker <starmaker@ix.netcom.com> - 2025-12-14 12:52 -0800
I have a great idea The Starmaker <starmaker@ix.netcom.com> - 2025-12-14 13:11 -0800
Einstein refrigerator (was: parallel random-access machine (parallel RAM or PRAM) Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-15 03:00 +0100
Re: Einstein refrigerator (was: parallel random-access machine (parallel RAM or PRAM) The Starmaker <starmaker@ix.netcom.com> - 2025-12-14 19:46 -0800
Re: parallel random-access machine (parallel RAM or PRAM) The Starmaker <starmaker@ix.netcom.com> - 2025-12-14 10:27 -0800
Re: parallel random-access machine (parallel RAM or PRAM) The Starmaker <starmaker@ix.netcom.com> - 2025-12-14 10:58 -0800
Re: parallel random-access machine (parallel RAM or PRAM) Thomas Heger <ttt_heg@web.de> - 2025-12-15 07:50 +0100
Re: parallel random-access machine (parallel RAM or PRAM) "Paul.B.Andersen" <relativity@paulba.no> - 2025-12-15 14:05 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Thomas Heger <ttt_heg@web.de> - 2025-12-16 08:44 +0100
Re: parallel random-access machine (parallel RAM or PRAM) "Paul.B.Andersen" <relativity@paulba.no> - 2025-12-16 22:58 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Thomas Heger <ttt_heg@web.de> - 2025-12-17 08:50 +0100
Re: parallel random-access machine (parallel RAM or PRAM) "Paul.B.Andersen" <relativity@paulba.no> - 2025-12-17 14:00 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Lemuel Agababov <uamv@oaabao.ru> - 2025-12-17 16:58 +0000
Re: parallel random-access machine (parallel RAM or PRAM) Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-17 18:33 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Eniel Habalov <ia@anael.ru> - 2025-12-18 16:22 +0000
Re: parallel random-access machine (parallel RAM or PRAM) The Starmaker <starmaker@ix.netcom.com> - 2025-12-17 10:49 -0800
Re: parallel random-access machine (parallel RAM or PRAM) The Starmaker <starmaker@ix.netcom.com> - 2025-12-17 11:23 -0800
Re: parallel random-access machine (parallel RAM or PRAM) "Paul.B.Andersen" <relativity@paulba.no> - 2025-12-17 14:24 +0100
Re: parallel random-access machine (parallel RAM or PRAM) The Starmaker <starmaker@ix.netcom.com> - 2025-12-18 22:13 -0800
Re: parallel random-access machine (parallel RAM or PRAM) The Starmaker <starmaker@ix.netcom.com> - 2025-12-19 12:02 -0800
Re: parallel random-access machine (parallel RAM or PRAM) Lynn Dobronos <rlbs@ddn.ru> - 2025-12-17 16:51 +0000
Re: parallel random-access machine (parallel RAM or PRAM) Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-17 18:24 +0100
Re: parallel random-access machine (parallel RAM or PRAM) Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-12-18 06:49 +0000
Re: parallel random-access machine (parallel RAM or PRAM) Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-06 05:30 +0100
Re: parallel random-access machine (parallel RAM or PRAM (Was: What is analog computing nowadays?) Pascual Sokolsky <aoa@ssppsc.pl> - 2025-12-01 19:58 +0000
Re: parallel random-access machine (parallel RAM or PRAM (Was: What is analog computing nowadays?) Mild Shock <janburse@fastmail.fm> - 2025-12-01 21:17 +0100
Re: parallel random-access machine (parallel RAM or PRAM (Was: What is analog computing nowadays?) Blending Molostvov <noo@biiooe.ru> - 2025-12-01 20:44 +0000
Algorithm introduced in Hogwild! SGD (Niu et al., 2011) (Re: parallel random-access machine) Mild Shock <janburse@fastmail.fm> - 2025-12-01 22:06 +0100
Linux kernel's RCU-protected hash tables (Re: Algorithm introduced in Hogwild! SGD (Niu et al., 2011)) Mild Shock <janburse@fastmail.fm> - 2025-12-01 22:26 +0100
String interning is HashSet and not HashMap (Was: Linux kernel's RCU-protected hash tables) Mild Shock <janburse@fastmail.fm> - 2025-12-01 22:40 +0100
Re: Algorithm introduced in Hogwild! SGD (Niu et al., 2011) (Re: parallel random-access machine) Bosephis Otlesnov <ooiv@th.ru> - 2025-12-01 21:42 +0000
POINT OF VIEW OF AN ALGORITHM (Re: Algorithm introduced in Hogwild! SGD (Niu et al., 2011)) (Re: parallel random-access machine) Mild Shock <janburse@fastmail.fm> - 2025-12-01 23:12 +0100
Introduction to AMBA® 4 ACE™ (2011) (Was: POINT OF VIEW OF AN ALGORITHM) Mild Shock <janburse@fastmail.fm> - 2025-12-01 23:37 +0100
Sputnik Schock: Academia is Disposable [I. J. Good Ultraintelligence] (Was: Introduction to AMBA® 4 ACE™ (2011)) Mild Shock <janburse@fastmail.fm> - 2025-12-01 23:53 +0100
Re: Introduction to AMBA® 4 ACE™ (2011) (Was: POINT OF VIEW OF AN ALGORITHM) Josbanne Balagula <ajbn@oll.ru> - 2025-12-01 23:06 +0000
Re: Introduction to AMBA® 4 ACE™ (2011) (Was: POINT OF VIEW OF AN ALGORITHM) Mild Shock <janburse@fastmail.fm> - 2025-12-02 00:08 +0100
Re: Could AlphaEvolve find the sixth busy beaver ? Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-11-30 14:06 +0100
Re: Could AlphaEvolve find the sixth busy beaver ? Dong Shamahov <hhh@dvgshv.ru> - 2025-11-30 15:46 +0000
You shouldn't use NPM hacked services (Was: Could AlphaEvolve find the sixth busy beaver ?) Mild Shock <janburse@fastmail.fm> - 2025-11-30 22:27 +0100
Its a subconscious hypothesis (Was: You shouldn't use NPM hacked services) Mild Shock <janburse@fastmail.fm> - 2025-11-30 22:33 +0100
What if of the cosmos does a BB dance? (Was: Its a subconscious hypothesis) Mild Shock <janburse@fastmail.fm> - 2025-11-30 22:43 +0100
Re: What if of the cosmos does a BB dance? (Was: Its a subconscious hypothesis) Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-01 23:43 +0100
Re: What if of the cosmos does a BB dance? Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-01 23:45 +0100
newsreader where you can see the message source (Was: What if of the cosmos does a BB dance?) Mild Shock <janburse@fastmail.fm> - 2025-12-02 00:00 +0100
Re: newsreader where you can see the message source (Was: What if of the cosmos does a BB dance?) Python <python@cccp.invalid> - 2025-12-02 03:10 +0000
Re: newsreader where you can see the message source (Was: What if of the cosmos does a BB dance?) Mild Shock <janburse@fastmail.fm> - 2025-12-02 11:51 +0100
Re: newsreader where you can see the message source (Was: What if of the cosmos does a BB dance?) Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-02 20:36 +0100
Re: newsreader where you can see the message source (Was: What if of the cosmos does a BB dance?) Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-01 21:42 -0800
Orbits of planets in the Sol System (was: newsreader where you can see the message source) Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-04 03:29 +0100
Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-04 03:30 +0100
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-05 14:56 -0800
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-05 15:22 -0800
Re: Orbits of planets in the Sol System The Starmaker <starmaker@ix.netcom.com> - 2025-12-06 15:00 -0800
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-07 10:57 +0100
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-07 11:03 +0100
Re: Orbits of planets in the Sol System Maciej Woźniak <mlwozniak@wp.pl> - 2025-12-07 16:17 +0100
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-07 17:59 -0800
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-07 18:07 -0800
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-07 18:16 -0800
Re: Orbits of planets in the Sol System The Starmaker <starmaker@ix.netcom.com> - 2025-12-07 21:39 -0800
Re: Orbits of planets in the Sol System The Starmaker <starmaker@ix.netcom.com> - 2025-12-08 12:14 -0800
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-08 12:41 -0800
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-08 13:11 -0800
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-09 04:49 +0100
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-08 17:33 +0100
Re: Orbits of planets in the Sol System Maciej Woźniak <mlwozniak@wp.pl> - 2025-12-08 18:39 +0100
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-08 12:29 -0800
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-09 04:41 +0100
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-08 21:41 -0800
Re: Orbits of planets in the Sol System The Starmaker <starmaker@ix.netcom.com> - 2025-12-09 11:56 -0800
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-09 12:15 -0800
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-09 23:35 +0100
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-10 02:17 -0800
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-10 12:01 -0800
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-10 13:25 -0800
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-09 05:45 +0100
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-09 05:47 +0100
Re: Orbits of planets in the Sol System Maciej Woźniak <mlwozniak@wp.pl> - 2025-12-09 06:47 +0100
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-09 11:50 -0800
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-09 23:47 +0100
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-10 02:01 -0800
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-11 03:20 +0100
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-11 10:29 -0800
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-12 09:04 +0100
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-12 01:20 -0800
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-12 10:20 -0800
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-13 17:46 +0100
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-13 11:44 -0800
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-13 23:26 +0100
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-13 15:28 -0800
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-15 03:52 +0100
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-14 22:35 -0800
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-14 22:45 -0800
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-17 18:52 +0100
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-17 17:39 -0800
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-18 04:23 +0100
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-18 02:29 -0800
Re: Orbits of planets in the Sol System Ross Finlayson <ross.a.finlayson@gmail.com> - 2025-12-14 23:01 -0800
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-13 23:27 +0100
Re: Orbits of planets in the Sol System Jonas Zhashkov <snos@kook.ru> - 2025-12-09 19:35 +0000
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-09 23:44 +0100
Re: Orbits of planets in the Sol System "D.J. Papadopulos" <sn@sppodd.gr> - 2025-12-10 15:34 +0000
Re: Orbits of planets in the Sol System Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-11 03:29 +0100
Re: Orbits of planets in the Sol System Erwin Shimanouchi <sicor@rinn.jp> - 2025-12-11 21:04 +0000
Re: Orbits of planets in the Sol System The Starmaker <starmaker@ix.netcom.com> - 2025-12-06 14:57 -0800
Re: Orbits of planets in the Sol System The Starmaker <starmaker@ix.netcom.com> - 2025-12-07 12:36 -0800
Re: Orbits of planets in the Sol System The Starmaker <starmaker@ix.netcom.com> - 2025-12-07 12:36 -0800
Re: Orbits of planets in the Sol System The Starmaker <starmaker@ix.netcom.com> - 2025-12-07 12:42 -0800
Re: newsreader where you can see the message source (Was: What if of the cosmos does a BB dance?) Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-02 20:35 +0100
Spock thinks I am interested in his gibberish (Re: newsreader where you can see the message source) Mild Shock <janburse@fastmail.fm> - 2025-12-02 23:22 +0100
Is it like "Wirres Mückengelaber" ? (Was: Spock thinks I am interested in his gibberish) Mild Shock <janburse@fastmail.fm> - 2025-12-02 23:28 +0100
Re: What if of the cosmos does a BB dance? Thomas Heger <ttt_heg@web.de> - 2025-12-03 07:22 +0100
Re: What if of the cosmos does a BB dance? The Starmaker <starmaker@ix.netcom.com> - 2025-12-03 08:27 -0800
Re: What if of the cosmos does a BB dance? Thomas Heger <ttt_heg@web.de> - 2025-12-04 07:57 +0100
Re: Its a subconscious hypothesis (Was: You shouldn't use NPM hacked services) Maciej Woźniak <mlwozniak@wp.pl> - 2025-11-30 23:14 +0100
Re: You shouldn't use NPM hacked services (Was: Could AlphaEvolve find the sixth busy beaver ?) Sebastian Zolotdinov <eso@iz.ru> - 2025-11-30 23:42 +0000
Putin payed trolls are usually name shifters [ethernal september morons] (Was: You shouldn't use NPM hacked services) Mild Shock <janburse@fastmail.fm> - 2025-12-01 11:19 +0100
Re: You shouldn't use NPM hacked services (Was: Could AlphaEvolve find the sixth busy beaver ?) Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-01 23:23 +0100
Re: You shouldn't use NPM hacked services (Was: Could AlphaEvolve find the sixth busy beaver ?) Mild Shock <janburse@fastmail.fm> - 2025-12-02 00:05 +0100
Re: You shouldn't use NPM hacked services Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2025-12-02 20:29 +0100
Spock thinks I am interested in his gibberish (Re: You shouldn't use NPM hacked services) Mild Shock <janburse@fastmail.fm> - 2025-12-02 23:25 +0100
Is it like "Wirres Mückengelaber" ? (Was: Spock thinks I am interested in his gibberish) Mild Shock <janburse@fastmail.fm> - 2025-12-02 23:29 +0100
What Spock aka Thomas 'PointedEars' Lahn missed (Was: Different Hubble Theories: de Sitter Energy) Mild Shock <janburse@fastmail.fm> - 2025-12-03 01:09 +0100
The size of a Gödel sentence G (Re: Could AlphaEvolve find the sixth busy beaver ?) Mild Shock <janburse@fastmail.fm> - 2025-12-03 09:00 +0100
The size of a Gödel sentence G (Re: Could AlphaEvolve find the sixth busy beaver ?) Mild Shock <janburse@fastmail.fm> - 2025-12-03 09:00 +0100
Attacking the Busy Beaver 5 [1989] (Re: The size of a Gödel sentence G) Mild Shock <janburse@fastmail.fm> - 2025-12-03 09:10 +0100
Re: Could AlphaEvolve find the sixth busy beaver ? Sylvia Else <sylvia@email.invalid> - 2025-12-04 12:59 +0800
Page 5 of 10 — ← Prev page 1 … 3 4 [5] 6 7 … 10 Next page →
| From | Thomas 'PointedEars' Lahn <PointedEars@web.de> |
|---|---|
| Date | 2025-12-06 05:30 +0100 |
| Subject | Re: parallel random-access machine (parallel RAM or PRAM) |
| Message-ID | <10h0bgs$34ef0$1@gwaiyur.mb-net.net> |
| In reply to | #667682 |
Thomas Heger amok-crossposted over 3 newsgroups without Followup-To (!): > Am Mittwoch000003, 03.12.2025 um 08:02 schrieb Thomas 'PointedEars' Lahn: >> Thomas Heger wrote: >>> Am Montag000001, 01.12.2025 um 13:23 schrieb Maciej Woźniak: >>>> We can use von Neumann architecture >>>> to emulate other architectures, but as long as it >>>> is performed by our computers it is technically >>>> von Neumann's. >>>> >>> Did you know, that 'von [Neumann] architecture' >> >> [correction] >> >>> was actually invented and patented by Konrad Zuse in Germany in the early >>> 1930th? >> >> NOT true. Von Neumann's architecture "was based on the work of J. Presper >> Eckert and John Mauchly, inventors of ENIAC and its successor, EDVAC." > > https://de.wikipedia.org/wiki/Zuse_Z3 > > Didn't you know, that 1937 was much earlier than the Eniac in 1945? If you had cared to read more carefully, you would have noticed that the Z3 was a digital computer, but still *electromechanical* (it had *moving parts*), while the ENIAC was an *electronic* digital computer (*no moving parts*): <https://en.wikipedia.org/wiki/Z3_(computer)> > [conspiracy theory] Get well soon. F'up2 comp.lang.misc again -- PointedEars Twitter: @PointedEars2 Please do not cc me. / Bitte keine Kopien per E-Mail.
[toc] | [prev] | [next] | [standalone]
| From | Pascual Sokolsky <aoa@ssppsc.pl> |
|---|---|
| Date | 2025-12-01 19:58 +0000 |
| Subject | Re: parallel random-access machine (parallel RAM or PRAM (Was: What is analog computing nowadays?) |
| Message-ID | <10gks0o$1krf9$1@dont-email.me> |
| In reply to | #667615 |
Mild Shock wrote: > But in principle the architecture is rather: > > parallel random-access machine (parallel RAM or PRAM) is a shared-memory > abstract machine. https://en.wikipedia.org/wiki/Parallel_RAM > > The above class of machines is not widely know. > But PRAM has been also studied, already in the 80's. parallel read of shared memory is only allowed to cia and the chinese governoment; must be somenthing you dont know
[toc] | [prev] | [next] | [standalone]
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Date | 2025-12-01 21:17 +0100 |
| Subject | Re: parallel random-access machine (parallel RAM or PRAM (Was: What is analog computing nowadays?) |
| Message-ID | <10gkt46$vosq$1@solani.org> |
| In reply to | #667624 |
What are you, a 5 year old moron? Pascual Sokolsky schrieb: > Mild Shock wrote: > >> But in principle the architecture is rather: >> >> parallel random-access machine (parallel RAM or PRAM) is a shared-memory >> abstract machine. https://en.wikipedia.org/wiki/Parallel_RAM >> >> The above class of machines is not widely know. >> But PRAM has been also studied, already in the 80's. > > parallel read of shared memory is only allowed to cia and the chinese > governoment; must be somenthing you dont know >
[toc] | [prev] | [next] | [standalone]
| From | Blending Molostvov <noo@biiooe.ru> |
|---|---|
| Date | 2025-12-01 20:44 +0000 |
| Subject | Re: parallel random-access machine (parallel RAM or PRAM (Was: What is analog computing nowadays?) |
| Message-ID | <10gkuno$1mfrd$1@dont-email.me> |
| In reply to | #667625 |
Mild Shock wrote: > What are you, a 5 year old moron? > > Pascual Sokolsky schrieb: >> Mild Shock wrote: >> >>> But in principle the architecture is rather: >>> >>> parallel random-access machine (parallel RAM or PRAM) is a >>> shared-memory abstract machine. >>> https://en.wikipedia.org/wiki/Parallel_RAM >>> >>> The above class of machines is not widely know. >>> But PRAM has been also studied, already in the 80's. >> >> parallel read of shared memory is only allowed to cia and the chinese >> governoment; must be somenthing you dont know from shared memory you only read and write sequential, me frendo, driven by semaphores, atomic instructions and so on. You are not that fucking stupid to write parallel to a cell, are you
[toc] | [prev] | [next] | [standalone]
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Date | 2025-12-01 22:06 +0100 |
| Subject | Algorithm introduced in Hogwild! SGD (Niu et al., 2011) (Re: parallel random-access machine) |
| Message-ID | <10gl01c$vqnp$1@solani.org> |
| In reply to | #667626 |
Hi, What are you, a 5 year old moron? There are millions of algorithm that use volatile variables. Just look at the Java code base. But I was not refering to multi-threading, I was refering to PRAM for matrix operations. See for example here: Hogwild!: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent https://arxiv.org/pdf/1106.5730 Fuck off moron. Bye Blending Molostvov schrieb: > Mild Shock wrote: > >> What are you, a 5 year old moron? >> >> Pascual Sokolsky schrieb: >>> Mild Shock wrote: >>> >>>> But in principle the architecture is rather: >>>> >>>> parallel random-access machine (parallel RAM or PRAM) is a >>>> shared-memory abstract machine. >>>> https://en.wikipedia.org/wiki/Parallel_RAM >>>> >>>> The above class of machines is not widely know. >>>> But PRAM has been also studied, already in the 80's. >>> >>> parallel read of shared memory is only allowed to cia and the chinese >>> governoment; must be somenthing you dont know > > from shared memory you only read and write sequential, me frendo, > driven by semaphores, atomic instructions and so on. You are not that > fucking stupid to write parallel to a cell, are you >
[toc] | [prev] | [next] | [standalone]
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Date | 2025-12-01 22:26 +0100 |
| Subject | Linux kernel's RCU-protected hash tables (Re: Algorithm introduced in Hogwild! SGD (Niu et al., 2011)) |
| Message-ID | <10gl15e$vrm9$1@solani.org> |
| In reply to | #667627 |
Hi, An example of a lock free datastructure, that even doesn't use CAS, is for example: Read-Copy-Update (RCU) Based Hash Tables These use only memory barriers/fences and atomic pointer writes: - Basic approach: Readers access the table without locks, writers create new versions - Memory reclamation: Uses RCU grace periods instead of CAS - Example: Linux kernel's RCU-protected hash tables - Operations: Only requires atomic loads/stores and memory barriers For Prolog systems there are also various approaches arround, if one aims at the multi-threading model for dynamic databass or atom tables. I think this multi-threading model should be abadoned, in favor of things that can be speed up by a AI accelerator. Dogelog Player has abandoned multi-threading all together. But for example SWI-Prolog has heavily focused on lock free data structures already like 10 years ago, and it seems YAP can still not keep up with SWI-Prolog. See for example here: Yet Another Lock-Free Atom Table Design for Scalable Symbol Management in Prolog https://link.springer.com/article/10.1007/s10766-024-00766-z But in my opinion, in the light of the AI Boom, this is all amplified nonsense. Bye Mild Shock schrieb: > Hi, > > What are you, a 5 year old moron? > > There are millions of algorithm that use volatile > variables. Just look at the Java code base. > > But I was not refering to multi-threading, I > was refering to PRAM for matrix operations. > > See for example here: > > Hogwild!: A Lock-Free Approach to > Parallelizing Stochastic Gradient Descent > https://arxiv.org/pdf/1106.5730 > > Fuck off moron. > > Bye > > Blending Molostvov schrieb: >> Mild Shock wrote: >> >>> What are you, a 5 year old moron? >>> >>> Pascual Sokolsky schrieb: >>>> Mild Shock wrote: >>>> >>>>> But in principle the architecture is rather: >>>>> >>>>> parallel random-access machine (parallel RAM or PRAM) is a >>>>> shared-memory abstract machine. >>>>> https://en.wikipedia.org/wiki/Parallel_RAM >>>>> >>>>> The above class of machines is not widely know. >>>>> But PRAM has been also studied, already in the 80's. >>>> >>>> parallel read of shared memory is only allowed to cia and the chinese >>>> governoment; must be somenthing you dont know >> >> from shared memory you only read and write sequential, me frendo, >> driven by semaphores, atomic instructions and so on. You are not that >> fucking stupid to write parallel to a cell, are you >> >
[toc] | [prev] | [next] | [standalone]
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Date | 2025-12-01 22:40 +0100 |
| Subject | String interning is HashSet and not HashMap (Was: Linux kernel's RCU-protected hash tables) |
| Message-ID | <10gl203$vs4r$1@solani.org> |
| In reply to | #667629 |
Hi, The Linux kernel's RCU-protected hash tables is still not free of problems. Multiple writers might still need extra work. String interning with a HashSet (no values, just keys) is actually easier to make lock-free without full CAS because you're only concerned with existence, not updates. Bye P.S.: I am not affected by this amplified nonsense. Dogelog Player has even no atom table. And since it is single threaded, the HashMap for predicate lookup is totally lock free. It is single threaded and it has cooperative multithreading. Internally it uses async/await from JavaScript for example, which is a cooperative multthreading approach, but from the outside it provides tasks and sleep and stuff. Recently demonstrated a little Strudel style music coding: Strudel Coding in Dogelog Player https://medium.com/2989/bbb9c78fcd67 In basically declared multi-threading dead, before AI accelerators were there. I had more some worker things in mind, with more thorough siloing and isolation. But now that we have AI accelerators, the decision to abandon multithreadinhg looks even more splendid. Mild Shock schrieb: > Hi, > > An example of a lock free datastructure, that > even doesn't use CAS, is for example: > > Read-Copy-Update (RCU) Based Hash Tables > These use only memory barriers/fences and atomic pointer writes: > - Basic approach: Readers access the table without locks, > writers create new versions > - Memory reclamation: Uses RCU grace periods instead of CAS > - Example: Linux kernel's RCU-protected hash tables > - Operations: Only requires atomic loads/stores and memory barriers > > For Prolog systems there are also various > approaches arround, if one aims at the multi-threading > model for dynamic databass or atom tables. > > I think this multi-threading model should be > abadoned, in favor of things that can be speed > up by a AI accelerator. Dogelog Player has abandoned > > multi-threading all together. But for example > SWI-Prolog has heavily focused on lock free > data structures already like 10 years ago, > > and it seems YAP can still not keep up with > SWI-Prolog. See for example here: > > Yet Another Lock-Free Atom Table Design > for Scalable Symbol Management in Prolog > https://link.springer.com/article/10.1007/s10766-024-00766-z > > But in my opinion, in the light of the AI Boom, > this is all amplified nonsense. > > Bye > > Mild Shock schrieb: >> Hi, >> >> What are you, a 5 year old moron? >> >> There are millions of algorithm that use volatile >> variables. Just look at the Java code base. >> >> But I was not refering to multi-threading, I >> was refering to PRAM for matrix operations. >> >> See for example here: >> >> Hogwild!: A Lock-Free Approach to >> Parallelizing Stochastic Gradient Descent >> https://arxiv.org/pdf/1106.5730 >> >> Fuck off moron. >> >> Bye >> >> Blending Molostvov schrieb: >>> Mild Shock wrote: >>> >>>> What are you, a 5 year old moron? >>>> >>>> Pascual Sokolsky schrieb: >>>>> Mild Shock wrote: >>>>> >>>>>> But in principle the architecture is rather: >>>>>> >>>>>> parallel random-access machine (parallel RAM or PRAM) is a >>>>>> shared-memory abstract machine. >>>>>> https://en.wikipedia.org/wiki/Parallel_RAM >>>>>> >>>>>> The above class of machines is not widely know. >>>>>> But PRAM has been also studied, already in the 80's. >>>>> >>>>> parallel read of shared memory is only allowed to cia and the chinese >>>>> governoment; must be somenthing you dont know >>> >>> from shared memory you only read and write sequential, me frendo, >>> driven by semaphores, atomic instructions and so on. You are not that >>> fucking stupid to write parallel to a cell, are you >>> >> >
[toc] | [prev] | [next] | [standalone]
| From | Bosephis Otlesnov <ooiv@th.ru> |
|---|---|
| Date | 2025-12-01 21:42 +0000 |
| Subject | Re: Algorithm introduced in Hogwild! SGD (Niu et al., 2011) (Re: parallel random-access machine) |
| Message-ID | <10gl238$1nj5e$1@dont-email.me> |
| In reply to | #667627 |
Mild Shock wrote: > What are you, a 5 year old moron? > > There are millions of algorithm that use volatile variables. Just look > at the Java code base. > > But I was not refering to multi-threading, I was refering to PRAM for > matrix operations. i thought you said you wanna read and write parallel to RAM, aka PRAM, let me see.. zum zum zum, yeah, you said that. Take a lock at timing requirements for a read/write cycle, deadlines etc, shared memory or not, fucking idiot.
[toc] | [prev] | [next] | [standalone]
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Date | 2025-12-01 23:12 +0100 |
| Subject | POINT OF VIEW OF AN ALGORITHM (Re: Algorithm introduced in Hogwild! SGD (Niu et al., 2011)) (Re: parallel random-access machine) |
| Message-ID | <10gl3ru$vt77$1@solani.org> |
| In reply to | #667631 |
Hi, I am not saying anything. Thats the definition of PRAM. Whats wrong with you, are you a 5 year old moron. I am only citing a theoretical computer science model: - Concurrent read concurrent write (CRCW)—multiple processors can read and write. A CRCW PRAM is sometimes called a concurrent random-access machine. https://en.wikipedia.org/wiki/Parallel_RAM Technically with multi-channel memory nowadays, it doesn't need locks on the hardware level, only tiny serialization, could even happen outside of the CPU. So if you drop some barrier requirements, you could really have the chaos of a PRAM, for worse or for better. I think you need to accept that, even if its to big to fit in your tiny squirrel brain. Bye P.S.: "effectively CREW, since only one write per address at a time", it will just block the other cores? Short answer: Yes — if two cores try to write the same address, one of them is forced to stall (block) until the other completes. In real hardware, the effect can mimic CRCW behavior over a short time window, even though it’s not truly simultaneous. this blocking usually happens in the cache-coherence system, not at DRAM. Modern CPUs use MESI/MOESI. It happens over a small interval [t₁, t₂] dictated by cache coherence. From the POINT OF VIEW OF AN ALGORITHM, it’s “CRCW enough.” Bosephis Otlesnov schrieb: > Mild Shock wrote: > >> What are you, a 5 year old moron? >> >> There are millions of algorithm that use volatile variables. Just look >> at the Java code base. >> >> But I was not refering to multi-threading, I was refering to PRAM for >> matrix operations. > > i thought you said you wanna read and write parallel to RAM, aka PRAM, let > me see.. zum zum zum, yeah, you said that. Take a lock at timing > requirements for a read/write cycle, deadlines etc, shared memory or not, > fucking idiot. >
[toc] | [prev] | [next] | [standalone]
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Date | 2025-12-01 23:37 +0100 |
| Subject | Introduction to AMBA® 4 ACE™ (2011) (Was: POINT OF VIEW OF AN ALGORITHM) |
| Message-ID | <10gl5b2$vu4n$1@solani.org> |
| In reply to | #667632 |
Hi, Come on squirrel brain, that we practically have PRAM on multi-core CPUs, is an old hat. ARM kept up with MESI/MOESI in 2011: https://developer.arm.com/-/media/Arm%20Developer%20Community/PDF/CacheCoherencyWhitepaper_6June2011.pdf What are you squirrel brain, some russion developer controlling a drone from within EMACS ? Meanwhile ARM and Intel and Snapdragon etc.. have developed much more marvels than only this simple PRAM. The excitement on the side of ARM is quite big, that they got into the boat of OpenAI: OpenAI co-founder on new deal with AMD https://www.youtube.com/watch?v=WuXCNpbO9hI Bye P.S.: Because of contention, you should of course only use volatile variables carefully. It might not scale well to 1000 cores. There are also algorithms around to lift the pressure when there is a large amount of cores. Even Doug Lea has already put a few utilities in java.concurrent.* for certain problems with large number of cores, kind of easter eggs in java.concurrent.*. But I am not sure whether Doug Lea is involved in additions for AI accelerators. But he is in the Program Committee of: Parallel programming for emerging hardware, including AI accelerators, processor-in-memory, programmable logic, non-volatile memory technologies, and quantum computers https://ppopp26.sigplan.org/track/PPoPP-2026-papers It could be that the data flow compiler, things sketched by OpenXLA already work well enough. Mild Shock schrieb: > Hi, > > I am not saying anything. Thats the definition of PRAM. > Whats wrong with you, are you a 5 year old moron. > I am only citing a theoretical computer science model: > > - Concurrent read concurrent write (CRCW)—multiple > processors can read and write. A CRCW PRAM is sometimes > called a concurrent random-access machine. > https://en.wikipedia.org/wiki/Parallel_RAM > > Technically with multi-channel memory nowadays, it > doesn't need locks on the hardware level, only tiny > serialization, could even happen outside of the CPU. > > So if you drop some barrier requirements, you could > really have the chaos of a PRAM, for worse or > for better. I think you need to accept that, > > even if its to big to fit in your tiny squirrel brain. > > Bye > > P.S.: "effectively CREW, since only one write per address at > a time", it will just block the other cores? Short answer: > Yes — if two cores try to write the same address, one > > of them is forced to stall (block) until the other completes. > In real hardware, the effect can mimic CRCW behavior over > a short time window, even though it’s not truly simultaneous. > > this blocking usually happens in the cache-coherence > system, not at DRAM. Modern CPUs use MESI/MOESI. It happens > over a small interval [t₁, t₂] dictated by cache coherence. > > From the POINT OF VIEW OF AN ALGORITHM, it’s “CRCW enough.” > > > Bosephis Otlesnov schrieb: >> Mild Shock wrote: >> >>> What are you, a 5 year old moron? >>> >>> There are millions of algorithm that use volatile variables. Just look >>> at the Java code base. >>> >>> But I was not refering to multi-threading, I was refering to PRAM for >>> matrix operations. >> >> i thought you said you wanna read and write parallel to RAM, aka PRAM, >> let >> me see.. zum zum zum, yeah, you said that. Take a lock at timing >> requirements for a read/write cycle, deadlines etc, shared memory or not, >> fucking idiot. >> >
[toc] | [prev] | [next] | [standalone]
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Date | 2025-12-01 23:53 +0100 |
| Subject | Sputnik Schock: Academia is Disposable [I. J. Good Ultraintelligence] (Was: Introduction to AMBA® 4 ACE™ (2011)) |
| Message-ID | <10gl691$vujj$1@solani.org> |
| In reply to | #667634 |
Hi, Looking at how they phrase it: "symposium focuses on improving the programming productivity and performance engineering of all concurrent and parallel systems—multicore, multi- threaded, heterogeneous, clustered, and distributed systems, grids, accelerators such as ASICs, GPUs, FPGAs, data centers, clouds, large scale machines, and quantum computers. PPoPP is also interested in new and emerging parallel workloads and applications, such as artificial intelligence and large-scale scientific/enterprise workloads." https://ppopp26.sigplan.org/track/PPoPP-2026-papers It could be also that academia was overrun by the AI boom. Is lost in the nowhere. That the techno lords have created realities turning the academia into savages. No wonder there is a call for automated AI researchers, and automated AI engineers, by the AI industry itself. And which might be the outcome of the current manhatten project, also known as genesis mission. So that the AI can be programmed by AI, AI which is more knowledgable than tiny accademics. We are maybe heading towards a first Ultraintelligence, that will then shape subsequent Ultraintelligences. As described by I. J. Good: "Let an ultraintelligent machine be defined as a machine that can far surpass all the intellectual activities of any man however clever. Since the design of machines is one of these intellectual activities, an ultraintelligent machine could design even better machines; there would then unquestionably be an 'intelligence explosion,' and the intelligence of man would be left far behind... Thus the first ultraintelligent machine is the last invention that man need ever make, provided that the machine is docile enough to tell us how to keep it under control. It is curious that this point is made so seldom outside of science fiction. It is sometimes worthwhile to take science fiction seriously." https://exhibits.stanford.edu/feigenbaum/catalog/gz727rg3869 Bye Mild Shock schrieb: > Hi, > > Come on squirrel brain, that we practically have > PRAM on multi-core CPUs, is an old hat. ARM kept > up with MESI/MOESI in 2011: > > https://developer.arm.com/-/media/Arm%20Developer%20Community/PDF/CacheCoherencyWhitepaper_6June2011.pdf > > > What are you squirrel brain, some russion developer > controlling a drone from within EMACS ? Meanwhile > ARM and Intel and Snapdragon etc.. have developed > > much more marvels than only this simple PRAM. > The excitement on the side of ARM is quite big, > that they got into the boat of OpenAI: > > OpenAI co-founder on new deal with AMD > https://www.youtube.com/watch?v=WuXCNpbO9hI > > Bye > > P.S.: Because of contention, you should of course > only use volatile variables carefully. It might > not scale well to 1000 cores. > > There are also algorithms around to lift the > pressure when there is a large amount of cores. > Even Doug Lea has already put a few utilities in > > java.concurrent.* for certain problems with large > number of cores, kind of easter eggs in java.concurrent.*. > But I am not sure whether Doug Lea is involved in > > additions for AI accelerators. But he is in the > Program Committee of: > > Parallel programming for emerging hardware, including > AI accelerators, processor-in-memory, programmable logic, > non-volatile memory technologies, and quantum computers > https://ppopp26.sigplan.org/track/PPoPP-2026-papers > > It could be that the data flow compiler, things sketched > by OpenXLA already work well enough. > > Mild Shock schrieb: >> Hi, >> >> I am not saying anything. Thats the definition of PRAM. >> Whats wrong with you, are you a 5 year old moron. >> I am only citing a theoretical computer science model: >> >> - Concurrent read concurrent write (CRCW)—multiple >> processors can read and write. A CRCW PRAM is sometimes >> called a concurrent random-access machine. >> https://en.wikipedia.org/wiki/Parallel_RAM >> >> Technically with multi-channel memory nowadays, it >> doesn't need locks on the hardware level, only tiny >> serialization, could even happen outside of the CPU. >> >> So if you drop some barrier requirements, you could >> really have the chaos of a PRAM, for worse or >> for better. I think you need to accept that, >> >> even if its to big to fit in your tiny squirrel brain. >> >> Bye >> >> P.S.: "effectively CREW, since only one write per address at >> a time", it will just block the other cores? Short answer: >> Yes — if two cores try to write the same address, one >> >> of them is forced to stall (block) until the other completes. >> In real hardware, the effect can mimic CRCW behavior over >> a short time window, even though it’s not truly simultaneous. >> >> this blocking usually happens in the cache-coherence >> system, not at DRAM. Modern CPUs use MESI/MOESI. It happens >> over a small interval [t₁, t₂] dictated by cache coherence. >> >> From the POINT OF VIEW OF AN ALGORITHM, it’s “CRCW enough.” >> >> >> Bosephis Otlesnov schrieb: >>> Mild Shock wrote: >>> >>>> What are you, a 5 year old moron? >>>> >>>> There are millions of algorithm that use volatile variables. Just look >>>> at the Java code base. >>>> >>>> But I was not refering to multi-threading, I was refering to PRAM for >>>> matrix operations. >>> >>> i thought you said you wanna read and write parallel to RAM, aka >>> PRAM, let >>> me see.. zum zum zum, yeah, you said that. Take a lock at timing >>> requirements for a read/write cycle, deadlines etc, shared memory or >>> not, >>> fucking idiot. >>> >> >
[toc] | [prev] | [next] | [standalone]
| From | Josbanne Balagula <ajbn@oll.ru> |
|---|---|
| Date | 2025-12-01 23:06 +0000 |
| Subject | Re: Introduction to AMBA® 4 ACE™ (2011) (Was: POINT OF VIEW OF AN ALGORITHM) |
| Message-ID | <10gl71a$1pk27$1@dont-email.me> |
| In reply to | #667634 |
Mild Shock wrote: > What are you squirrel brain, some russion developer controlling a drone > from within EMACS ? Meanwhile ARM and Intel and Snapdragon etc.. have > developed > > much more marvels than only this simple PRAM. > The excitement on the side of ARM is quite big, that they got into the > boat of OpenAI: if you guys from now on, are starting to write parallel to RAM, certainly you gonna win the war; this never occurred to me. My butt, this must be your secret weapon in the blitzkrieg
[toc] | [prev] | [next] | [standalone]
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Date | 2025-12-02 00:08 +0100 |
| Subject | Re: Introduction to AMBA® 4 ACE™ (2011) (Was: POINT OF VIEW OF AN ALGORITHM) |
| Message-ID | <10gl766$u42u$1@solani.org> |
| In reply to | #667640 |
You always sound like a 5 year old imbecil. Did they install computers in your kindergarden. And now you are making random posts idiot russ bot. Josbanne Balagula schrieb: > Mild Shock wrote: > >> What are you squirrel brain, some russion developer controlling a drone >> from within EMACS ? Meanwhile ARM and Intel and Snapdragon etc.. have >> developed >> >> much more marvels than only this simple PRAM. >> The excitement on the side of ARM is quite big, that they got into the >> boat of OpenAI: > > if you guys from now on, are starting to write parallel to RAM, certainly > you gonna win the war; this never occurred to me. My butt, this must be > your secret weapon in the blitzkrieg >
[toc] | [prev] | [next] | [standalone]
| From | Thomas 'PointedEars' Lahn <PointedEars@web.de> |
|---|---|
| Date | 2025-11-30 14:06 +0100 |
| Message-ID | <10ghfg7$1vhtd$1@gwaiyur.mb-net.net> |
| In reply to | #667597 |
Mild Shock wrote: ^^^^^^^^^^ Your real name should be there. > [...] > We prove that S(5) = 47, 176, 870 using the Coq proof > assistant. The Busy Beaver value S(n) is the maximum > number of steps that an n-state 2-symbol Turing machine > can perform from the all-zero tape before halting, [..] What is the relation of this to physics in general, and the theories of relativity in particular? If there is no relation, it does not belong there. Please do not crosspost mindlessly. F'up2 sci.physics.relativity so that the possible reason lands in the right place. -- PointedEars Twitter: @PointedEars2 Please do not cc me. / Bitte keine Kopien per E-Mail.
[toc] | [prev] | [next] | [standalone]
| From | Dong Shamahov <hhh@dvgshv.ru> |
|---|---|
| Date | 2025-11-30 15:46 +0000 |
| Message-ID | <10ghosn$f5jo$2@dont-email.me> |
| In reply to | #667601 |
Thomas 'PointedEars' Lahn wrote: > Mild Shock wrote: > ^^^^^^^^^^ > Your real name should be there. the name of this disgusting distinct imbecile is Thomas 'Braindead' Lahn
[toc] | [prev] | [next] | [standalone]
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Date | 2025-11-30 22:27 +0100 |
| Subject | You shouldn't use NPM hacked services (Was: Could AlphaEvolve find the sixth busy beaver ?) |
| Message-ID | <10gicrb$u4ep$2@solani.org> |
| In reply to | #667601 |
Hi, 503 Service Temporarily Unavailable https://stackoverflow.com/users/855543/pointedears LoL Bye Thomas 'PointedEars' Lahn schrieb: > Mild Shock wrote: > ^^^^^^^^^^ > Your real name should be there. > >> [...] >> We prove that S(5) = 47, 176, 870 using the Coq proof >> assistant. The Busy Beaver value S(n) is the maximum >> number of steps that an n-state 2-symbol Turing machine >> can perform from the all-zero tape before halting, [..] > > What is the relation of this to physics in general, and the theories of > relativity in particular? > > If there is no relation, it does not belong there. Please do not crosspost > mindlessly. > > F'up2 sci.physics.relativity so that the possible reason lands in the right > place. >
[toc] | [prev] | [next] | [standalone]
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Date | 2025-11-30 22:33 +0100 |
| Subject | Its a subconscious hypothesis (Was: You shouldn't use NPM hacked services) |
| Message-ID | <10gid70$u4ep$3@solani.org> |
| In reply to | #667605 |
Hi, Well I even don't know why I came up with the NPM hack hypothesis. Saw something on youtube. Maybe they just do maintenance. In the coming age of analog computing, symbolic logic means nothing: “The high data-rate sense perception and identification abilities of the human system mostly bypass verbal/analytic awareness. We are generally conscious of a cognitive recognition after the fact. In this way, what we understand as consciousness has to be identified as a reflexive monitoring ability with quite limited application. To produce consciousness (artificial or otherwise) we are stepping down, not up.” ― Frank Herbert, Destination: Void The comming age of analog computing might affect astrophisics, like telescope image processing who knows what. It probably does already. Have Fun! Bye Mild Shock schrieb: > Hi, > > 503 Service Temporarily Unavailable > https://stackoverflow.com/users/855543/pointedears > > LoL > > Bye > > Thomas 'PointedEars' Lahn schrieb: >> Mild Shock wrote: >> ^^^^^^^^^^ >> Your real name should be there. >> >>> [...] >>> We prove that S(5) = 47, 176, 870 using the Coq proof >>> assistant. The Busy Beaver value S(n) is the maximum >>> number of steps that an n-state 2-symbol Turing machine >>> can perform from the all-zero tape before halting, [..] >> >> What is the relation of this to physics in general, and the theories of >> relativity in particular? >> >> If there is no relation, it does not belong there. Please do not >> crosspost >> mindlessly. >> >> F'up2 sci.physics.relativity so that the possible reason lands in the >> right >> place. >> >
[toc] | [prev] | [next] | [standalone]
| From | Mild Shock <janburse@fastmail.fm> |
|---|---|
| Date | 2025-11-30 22:43 +0100 |
| Subject | What if of the cosmos does a BB dance? (Was: Its a subconscious hypothesis) |
| Message-ID | <10gidpt$u524$1@solani.org> |
| In reply to | #667606 |
Hi, What if the planets in certain galaxies form a turning machine. Maybe they do even a BusyBeaver dance. What are the limits of modelling in the coming age of analog computing. Could Keppler have modelled a 3 planet system. Can we model a 3 planet system now ? "The corresponding series converges extremely slowly. That is, obtaining a value of meaningful precision requires so many terms that this solution is of little practical use. Indeed, in 1930, David Beloriszky calculated that if Sundman's series were to be used for astronomical observations, then the computations would involve at least 10^8000000 terms" https://en.wikipedia.org/wiki/Three-body_problem Could AlphaEvolve even find the sixth beaver. Bye Mild Shock schrieb: > Hi, > > Well I even don't know why I came up with > the NPM hack hypothesis. Saw something > on youtube. Maybe they just do maintenance. > > In the coming age of analog computing, > symbolic logic means nothing: > > “The high data-rate sense perception and > identification abilities of the human system > mostly bypass verbal/analytic awareness. We > are generally conscious of a cognitive > recognition after the fact. In this way, what > we understand as consciousness has to be > identified as a reflexive monitoring ability > with quite limited application. To produce > consciousness (artificial or otherwise) we > are stepping down, not up.” > ― Frank Herbert, Destination: Void > > The comming age of analog computing might affect > astrophisics, like telescope image processing > who knows what. It probably does already. > > Have Fun! > > Bye > > Mild Shock schrieb: >> Hi, >> >> 503 Service Temporarily Unavailable >> https://stackoverflow.com/users/855543/pointedears >> >> LoL >> >> Bye >> >> Thomas 'PointedEars' Lahn schrieb: >>> Mild Shock wrote: >>> ^^^^^^^^^^ >>> Your real name should be there. >>> >>>> [...] >>>> We prove that S(5) = 47, 176, 870 using the Coq proof >>>> assistant. The Busy Beaver value S(n) is the maximum >>>> number of steps that an n-state 2-symbol Turing machine >>>> can perform from the all-zero tape before halting, [..] >>> >>> What is the relation of this to physics in general, and the theories of >>> relativity in particular? >>> >>> If there is no relation, it does not belong there. Please do not >>> crosspost >>> mindlessly. >>> >>> F'up2 sci.physics.relativity so that the possible reason lands in the >>> right >>> place. >>> >> >
[toc] | [prev] | [next] | [standalone]
| From | Thomas 'PointedEars' Lahn <PointedEars@web.de> |
|---|---|
| Date | 2025-12-01 23:43 +0100 |
| Subject | Re: What if of the cosmos does a BB dance? (Was: Its a subconscious hypothesis) |
| Message-ID | <10gl5ma$27mnu$1@gwaiyur.mb-net.net> |
| In reply to | #667607 |
Mild Shock wrote: ^^^^^^^^^^ Please repair this. > What if the planets in certain galaxies > form a turning machine. They do not. You appear to be very confused about the applicability of computer science to natural science. Also, you should learn how to post. This was a completely new question, so you should not have posted it as a follow-up. Also, you should not have top-posted, i.e. you should not have appended the full quotation of the previous postings; such is maybe appropriate in business communication, but not in Usenet. It is also not appropriate to crosspost without Followup-To to *one* newsgroup set. I strongly suggest that you subscribe to news:news.announce.newusers, or consult Usenet posting guidelines on the Web to educate yourself about the communication medium that you are using here. Lest you be killfiled rather quickly by people. > Could Keppler Johannes _Kepler_ > have modelled a 3 planet system. Yes, he did, but not exactly. > Can we model a 3 planet system now ? Obviously; there are simulations of the Sol System e.g. in Universe Sandbox. But the 3-body-problem is not about 3 planets, but more general. There is no *general* *exact* solution to this problem; just a solution for the *restricted* 3-body-problem in which one of the objects has a very large mass; the second object, e.g. a gas giant like Jupiter, has a smaller mass and is very far away from the first object; and the third object. e.g. an asteroid, has a small that is small enough to be negligible, and is comparably far away from the first and second object, respectively. And this is neglecting general-relativistic corrections that lead to an additional contribution in the precession of the perihelia (orbits are not actually ellipses, closed curves). F'up2 sci.physics -- PointedEars Twitter: @PointedEars2 Please do not cc me. / Bitte keine Kopien per E-Mail.
[toc] | [prev] | [next] | [standalone]
| From | Thomas 'PointedEars' Lahn <PointedEars@web.de> |
|---|---|
| Date | 2025-12-01 23:45 +0100 |
| Subject | Re: What if of the cosmos does a BB dance? |
| Message-ID | <10gl5q9$27mnu$2@gwaiyur.mb-net.net> |
| In reply to | #667607 |
Mild Shock wrote: ^^^^^^^^^^ Please repair this. > Subject: What if of the cosmos does a BB dance? (Was: Its a subconscious hypothesis) The correct way to change the Subject is "... (was: ...)". Then some newsreaders can automatically remove the " (was: ...)" part on composing a follow-up. > What if the planets in certain galaxies > form a turning machine. They do not. You appear to be very confused about the applicability of computer science to natural science. Also, you should learn how to post. This was a completely new question, so you should not have posted it as a follow-up. Also, you should not have top-posted, i.e. you should not have appended the full quotation of the previous postings; such is maybe appropriate in business communication, but not in Usenet. It is also not appropriate to crosspost without Followup-To to *one* newsgroup set. I strongly suggest that you subscribe to news:news.announce.newusers, or consult Usenet posting guidelines on the Web to educate yourself about the communication medium that you are using here. Lest you be killfiled rather quickly by people. > Could Keppler Johannes _Kepler_ > have modelled a 3 planet system. Yes, he did, but not exactly. > Can we model a 3 planet system now ? Obviously; there are simulations of the Sol System e.g. in Universe Sandbox. But the 3-body-problem is not about 3 planets, but more general. There is no *general* *exact* solution to this problem; just a solution for the *restricted* 3-body-problem in which one of the objects has a very large mass; the second object, e.g. a gas giant like Jupiter, has a smaller mass and is very far away from the first object; and the third object. e.g. an asteroid, has a small that is small enough to be negligible, and is comparably far away from the first and second object, respectively. And this is neglecting general-relativistic corrections that lead to an additional contribution in the precession of the perihelia (orbits are not actually ellipses, closed curves). F'up2 sci.physics -- PointedEars Twitter: @PointedEars2 Please do not cc me. / Bitte keine Kopien per E-Mail.
[toc] | [prev] | [next] | [standalone]
Page 5 of 10 — ← Prev page 1 … 3 4 [5] 6 7 … 10 Next page →
Back to top | Article view | sci.physics.relativity
csiph-web