Forwarded from Hacker News (yahnc_bot)
Working Turing Machine https://ideas.lego.com/projects/10a3239f-4562-4d23-ba8e-f4fc94eef5c7
Lego
Turing Machine – Working Lego Computer | LEGO® Ideas
What is a Turing machine?It's an abstract model of an algorithmic machine. Although it was not designed to be implemented in real life, some people actually do …
🤯2🆒1
Forwarded from Hacker News (yahnc_bot)
NASA spacecraft to probe possibility of life in Europa's salty ocean https://www.science.org/content/article/nasa-spacecraft-probe-possibility-life-europa-s-salty-ocean
www.science.org
NASA spacecraft to probe possibility of life in Europa's salty ocean
Cutting-edge mission to Jupiter's moon could transform search for habitable worlds
🥱1
Forwarded from Hacker News (yahnc_bot)
The perils of transition to 64-bit time_t https://blogs.gentoo.org/mgorny/2024/09/28/the-perils-of-transition-to-64-bit-time_t/
Michał Górny
The perils of transition to 64-bit time_t
(please note that there’s a correction at the bottom) In the Overview of cross-architecture portability problems, I have dedicated a section to the problems resulting from use of 32-bit time_…
👍1
Forwarded from Hacker News (yahnc_bot)
Reverse-engineering a three-axis attitude indicator from the F-4 fighter plane http://www.righto.com/2024/09/f4-attitude-indicator.html
Righto
Reverse-engineering a three-axis attitude indicator from the F-4 fighter plane
We recently received an attitude indicator for the F-4 fighter plane, an instrument that uses a rotating ball to show the aircraft's orienta...
💘2
Forwarded from Hacker News (yahnc_bot)
Cores That Don't Count [pdf] https://sigops.org/s/conferences/hotos/2021/papers/hotos21-s01-hochschild.pdf
🥱1
工科猪咨询群友一个算法问题：
现在有一个 DAG，入度为 0 的节点称为输入，出度为 0 的节点称为输出。输入输出节点数量一致，有一个一一对应关系。
对这个 DAG 做一个“纵切”，要求满足以下条件：
1. 对应的输入和输出划分到一起（Hence “纵”）
2. 每个链保证只跨过 Cut 最多一次：也就是不允许出现以下这种链（以 A/B 表示划分到哪边）：
.. -> A -> B -> ... -> B -> A -> ...
用什么算法好，或者如何 Reduce 到一个比较好的图划分问题上，然后调库侠
X 问题：Circuit as SSA，状态是输入/输出节点，做划分，不允许组合逻辑跨过 Cut 两次
现在有一个 DAG，入度为 0 的节点称为输入，出度为 0 的节点称为输出。输入输出节点数量一致，有一个一一对应关系。
对这个 DAG 做一个“纵切”，要求满足以下条件：
1. 对应的输入和输出划分到一起（Hence “纵”）
2. 每个链保证只跨过 Cut 最多一次：也就是不允许出现以下这种链（以 A/B 表示划分到哪边）：
.. -> A -> B -> ... -> B -> A -> ...
用什么算法好，或者如何 Reduce 到一个比较好的图划分问题上，
X 问题：Circuit as SSA，状态是输入/输出节点，做划分，不允许组合逻辑跨过 Cut 两次