10,715 karma · joined February 10, 2010
Law LLM will surely help competent lawyers in their fields with greater sources of knowledge not in their core area of expertise.
The LLM generated code are correct about 80% of the time. Sometimes the generated code is overly complicated, has poor performance, missing a few assumptions, etc. that you need to review it carefully. It helps to have a solid and extensive set of tests.
Even a BTree with compressed prefix keys can save space in the qname.
The problem now is finding the correct antigens targeting the cancer cell type. Cancer cells are similar to health cells. You don't want to program a mRNA to generate antigen proteins that target health cells, which causes autoimmune problems.
You can solve the same problem with Range Min Query Tree. The query for balanced or unbalanced parentheses is O(log N). A two or three level RMQTree can represent billions of parentheses already (a two-level tree of 65536 branch factor = 4B parentheses). The query is O(65536 + 65536) or effectively O(1). For a four-level tree of 256 branch factor, the query is O(256 + 256 + 256 + 256) or O(1). It becomes a problem of memory access on the number of levels vs the number of entries to process per level. A total = 0 and min > 0 mean the parentheses are balanced.
The parentheses can be broken up into multiple segments, and be processed in parallel. Multiple RMQTrees can be used, one per segment, and the trees can be processed in parallel. Need to have a final pass to sum up the 'total' and 'min' from all the RMQTrees. Parallel processing probably doesn't gain much.
Regarding the full weight of the police, Shimomura did have an easier time to convince the ISP and phone companies to give him access to the logs. He was able to ask the cellular company to locate the cell tower where Mitnick's cell phone connected and traced him to the general area. If Mitnick had been careful, he could have hacked into the ISP/phone companies and erased all his access logs.