Computing the high infinite. Reordered threshold changes for the 385th to the 512th Laver tables.

The n-th monogenic Laver table is the unique algebraic structure A_n=({1,...,2^n},*) where x*(y*z)=(x*y)*(x*z) and x*1=x+1 mod 2^n for al x,y,z. One may use the thresholds to compute the n+1-th Laver table from the n-th Laver table. Let *_n denote the n-th Laver table operation. Define o_n(x) to be the least natural number where x*_n 2^{o_n(x)}=2^n. If x is in {1,...,2^(n-1)-1}, then we define the threshold \theta_n(x) to be the integer y in {0,...,2^o_n(x)} where x*y\leq 2^(n-1) and x*(y+1)\geq 2^(n-1)+1 and set \theta_n(2^(n-1))=0. The values \theta_n allow us to compute larger Laver tables from smaller ones. In most cases, \theta_(n-1)(x)=\theta_n(x), so we only need to take note of the instances where \theta_(n-1)(x) differs from \theta_n(x). This is a visualization of those cases where \theta_{384}(x) differs from \theta_{385}(x) where x is less than 2^256.This calculation allows us to compute the 385th Laver table up through the 512th Laver table.

I reordered the elements where x precedes y if there is some n with x=y mod 2^n but where x is in {1,...,2^n} mod 2^(n+1) and y=x+2^n mod 2^(n+1).

I computed these values using a conglomeration of techniques similar to machine learning and evolutionary computation to search for instances of non-distributivity. I do not have a proof that this is actually the threshold data that allows us to compute the 384th Laver table.

When I made these calculations, I did not use neural networks, but it seems like neural networks would be useful for making these calculations too or testing their accuracy.

The notion of a Laver table is not my own. Randall Dougherty has computed the 48th Laver table back in the 1990's, and I extended his technique to compute up to the 768th Laver table, but I made a tradeoff since I do not have a proof that my calculations are completely correct.

Unless otherwise stated, all algorithms featured on this channel are my own. You can go to https://github.com/sponsors/jvanname to support my research on machine learning algorithms. I am also available to consult on the use of safe and interpretable AI for your business. I am designing machine learning algorithms for AI safety such as LSRDRs. In particular, my algorithms are designed to be more predictable and understandable to humans than other machine learning algorithms, and my algorithms can be used to interpret more complex AI systems such as neural networks. With more understandable AI, we can ensure that AI systems will be used responsibly and that we will avoid catastrophic AI scenarios. There is currently nobody else who is working on LSRDRs, so your support will ensure a unique approach to AI safety.