Rethinking the AI-Tool Use Policy for the agentic era

Modular Forum Feedback
41

Other than the Lean programming language I searched for other algorithm’s that can be used to proof an AIs correctness.

Note: I’ve not done much research on this but I think you should go ahead and do more research. This means all the Information I can give about this algorithm is basic.

We can use BM decoding for this and to make it more efficient we apply the new iBM (Inversionless BerleKamp-Massey).

This algorithm can simply be defined as : “The Berlekamp-Massey algorithm is an efficient method used to find the shortest linear feedback shift register (LFSR) that generates a given sequence of numbers, or equivalently, the minimal polynomial of a sequence over a finite field. It is primarily applied in coding theory for decoding BCH and Reed-Solomon codes.”

Information source : Rosetta Code Berlekamp–Massey algorithm - Rosetta Code

What do you think?

Here is the repository:

Have you experimented on BM decoding before or are we on the same lane?

I think the modern version of this is the:

Source: IEEE A New Inversionless Berlekamp-Massey Algorithm with Efficient Architecture | IEEE Conference Publication | IEEE Xplore

I know this might be off topic when we’ve moved from discussing wether we should allow AI automated PRs to how we can make LLMs anti-error prone.

But what do you think?

1 Like