HN user

pvitz

787 karma
Posts22
Comments282
View on HN
wherewarlocksstayuplate.com 1y ago

Episode 1: Digital Jesus a.k.a. Matt Harrigan – Wwsul

pvitz
1pts0
hackaday.com 2y ago

Trolling IBM's Quantum Processor Advantage with a Commodore 64

pvitz
8pts1
www.bis.org 2y ago

Testing the cognitive limits of large language models [pdf]

pvitz
1pts0
docs.google.com 3y ago

Kparc.com B Language Description

pvitz
3pts0
www.bis.org 3y ago

Cryptotrading and Bitcoin prices:evidence from a new database of retail adoption [pdf]

pvitz
1pts0
arxiv.org 3y ago

De-anonymizing programmers from binaries (2017)

pvitz
103pts27
www.principiarewrite.com 4y ago

Principia Rewrite – Rewriting PM with Coq and LaTex

pvitz
1pts0
www.newyorker.com 5y ago

Vienna Is the New Havana Syndrome Hot Spot

pvitz
3pts1
www.theguardian.com 5y ago

Plan to use novels to predict next war

pvitz
4pts0
tmpout.sh 5y ago

Tmp.0ut Volume 1 – April 2021

pvitz
1pts0
opensourcerover.jpl.nasa.gov 5y ago

JPL Open Source Rover

pvitz
4pts0
arstechnica.com 5y ago

Zodiac Killer cipher is cracked after eluding sleuths for 51 years

pvitz
6pts0
arxiv.org 7y ago

Emergence of Exploitation as Symmetry Breaking in Iterated Prisoner's Dilemma

pvitz
2pts0
www.asciimation.co.nz 7y ago

The jet powered beer cooler

pvitz
1pts0
www.reddit.com 7y ago

Atiyah's computation of the fine structure constant (pertinent to RH preprint)

pvitz
1pts0
econpapers.repec.org 8y ago

Prob. forecasts for the '18 FIFA WC based on the bookmaker consensus model

pvitz
1pts0
networksciencebook.com 8y ago

Network Science

pvitz
1pts0
barabasi.com 8y ago

Barabasi's Journey to Network Science [pdf]

pvitz
2pts0
arxiv.org 9y ago

Election forensic analysis of the Turkish Constitutional Referendum 2017

pvitz
2pts0
webdocs.cs.ualberta.ca 9y ago

The First International RoShamBo Programming Competition

pvitz
1pts0
www.theguardian.com 9y ago

The Guardian's new income model

pvitz
4pts0
www.gatesnotes.com 9y ago

Warren Buffett’s Best Investment

pvitz
3pts0
Lua 5.5 7 months ago

From the manual:

   The control variable in for loops is read only. If you need to change it, declare a local variable with the same name in the loop body.
Also [0]: Roberto Ierusalimschy > So what's the rationale to make them constant now? Does it have performance > reasons?

Yes. The old code does an implicit "local x = x" for all loops, in case you modify 'x'. With the new semantics, the code only does it when you ask for it.

[0] https://groups.google.com/g/lua-l/c/SlAG5QfpTac

When I was a student of physics and came across this paragraph in Feynman's book, I was curious if he really meant the simple technique explained in the article, a more general one (also described in the article with the integral bounds as functions of a parameter) or something else. I don't know, but this led me to read the text "Advanced Calculus" by Edwin Bidwell Wilson (1912), which includes a lot of examples and gems. If there is some young student out there who wants to go well beyond the basic techniques of calculus taught in analysis or mathematical physics courses, have a look at [0].

[0] https://archive.org/details/advancedcalculus031579mbp/mode/1...

Thanks for your reply and advice! I guess what you describe as "impossible" is the case I am mostly interested in, though more for non-executable binary data. If I am not mistaken, this goes under the term "file fragment classification", but I have been wondering if practitioners might have figured out some better ways than what one can find in scholarly articles.

And yes, searching for the reimplementation beforehand would have saved me some hours :D

A shot in the dark, but maybe you could give me a hint. Recently, I was interested in extracting sprites from an old game. I was able to reverse the file format of the data archive, which contained the game assets as files. However, I got stuck because the image files were obviously compressed. By chance, I found an open source reimplementation of the game and realised it was LZ77+Huffman compressed, but how would one detect the type of compression and parameters with only the file? That seems a pretty hard problem or are there good heuristics to detect that?

[dead] 1 year ago

We have been in the process of upgrading to the latest version and can't continue. The lack of communication by Mathworks is very strange.

The reasons for this change seem to be described in [0] with the following summary:

  > The contribution workflow in Guix has been facing several challenges:
  > difficult onboarding, lack of legibility, complex, unreliable, and
  > labor-intensive infrastructure, and lack of automation.  All these lead
  > to an experience that contributors often find frustrating and hinders
  > quality assurance efforts.  We propose to address these limitations by
  > migrating repositories, issue tracking, and patch tracking to Codeberg,
  > an integrated forge with a Web interface that is hosted by a non-profit.
[0] https://archive.softwareheritage.org/browse/content/sha1_git...
Obituary for Cyc 1 year ago

But the longer I worked there the more I felt like the plan was basically:

1. Manually add more and more common-sense knowledge and extend the inference engine

2. ???

3. AGI!

In retrospect, this reasoning doesn't seem to be so wrong.

That the distribution was a fully translated system together with a thick manual (of course also in German) was the whole point and idea. Your comment is too dismissive in my opinion.

A system that would just output the most probable tokens based on the text it was fed and trained on the games played by players with ratings greater than 1800 would certainly fail to output the right moves to totally unlikely board positions.

It has been a very long time but I believe the logic was on the chip of the card. I vaguely remember that Tron of the CCC built simulators of cards that could be used to call for free. Maybe some research in that direction could lead to more on that topic.