Author: meditationatae

The sequence starts with 2, 4, and 8. Afterwards, the following rules are applied iteratively: So for example, if we start with 2, 4, 8: This should generate the sequence as you’ve described it. 2, 4, 8, 12, 16, 20, 28, 32, 36, 44, 52, 64, 68, 76, 84, 96, 108, 128, 132, 140, 148,… Continue reading ChatGPT-4 describes a sequence with simple rules

To calculate the terms of the chaotic TM sequence, it’s best to do it one bit at a time, meaning to do theleast significant bit first (or bit 1), then bit 2, then bit 3 and so on for a number of bit positionsapproximately equal to log_2(n_max), where n_max is the largest value of n… Continue reading Computing the lowest 6 bits of an unusual sequence

Sure, here’s a brief summary: In an attempt to improve efficiency in finding potential pseudoprimes (a number that passes certain primality tests despite not being prime), a number of evolving scripts have been employed, harnessing the mathematical power of the PARI/GP computing environment. These scripts aimed to conduct certain pseudoprime tests on terms generated from… Continue reading Pseudoprime testing, script included

Recently, our team has made significant progress in the research and exploration of Turing machines, specifically focusing on a five-state machine that exhibits chaotic behavior. The approach has been to examine the machine’s “tape” – the primary data structure that it manipulates. A new and innovative proposal has been put forward that may offer deeper… Continue reading Update on Turing Machine Research – Rethinking Tape Analysis

Congratulations on generating agreement for 512k terms of the sequence! The code you’ve shared appears to be a refinement of your original Turing machine implementation. Your code generates a binary sequence using the initial “gen” arrays, then expands this sequence exponentially by applying a recursive rule to generate the next “gen” array from the previous… Continue reading ChatGPT-4 comments on my program to predict a mysterious sequence

Our ongoing research into the mysterious sequence originating from Marxen and Buntrock’s chaotic Turing machine (Tm) continues to yield intriguing insights. We have implemented an advanced sequence generation algorithm in C, which successfully emulates the initial 4096 terms of this complex sequence, mirroring Marxen and Buntrock’s original process. The generation algorithm, which begins with five… Continue reading Progress Report on Chaotic Turing Machine Sequence Research

Background: We’ve been working on a problem related to predicting a specific sequence of numbers. The sequence is generated through a mysterious process that we are trying to model with a C program. The C program, however, is not correctly predicting the sequence as expected, leading to differences in output and therefore a challenging debugging… Continue reading Debugging and Prediction Challenges in Mysterious Sequence Generation Using C Code

The Mysterious Sequence is a peculiar binary pattern that we’ve been studying. Starting with a “1”, it generates a binary array by a simple rule: each bit duplicates itself and then appends an inverted version. This results in a fascinating pattern of zeros and ones. We initially thought this sequence might be related to the… Continue reading An Algorithmic Description of the “Mysterious Sequence”

Dear Team, I am writing to provide an update on the development of our prediction algorithm for the Moser-de Bruijn sequence. The sequence, notable for its origins in the run-length encoding of the tape of a chaotic 5-state Turing machine, presents unique challenges for accurate prediction. As you may know, the Moser-de Bruijn sequence is… Continue reading Memo on the Prediction Algorithm for the Moser-de Bruijn Sequence

Dear Team, I would like to bring your attention to an intriguing algorithm that we have recently developed. The goal was to predict the ‘next generation’ in the Moser-de Bruijn sequence. This sequence, found within number theory, is generated from the sum of distinct powers of 4 and carries intriguing structural properties. Our algorithm begins… Continue reading Generation Algorithm for Moser-de Bruijn Sequence

Indeed, the concept of “generations” and the understanding of sequential transitions has proved to be a very insightful approach in your investigation of the Moser-de Bruijn sequence. This generation-based concept has provided an effective framework to analyze and predict the pattern of the sequence. The identification of the last quarter of the current generation as… Continue reading Copied from ChatGPT-4 discussion

We have recently embarked on a study of the Moser-de Bruijn sequence and its generational patterns. The sequence is renowned for its intriguing recurrence and regularity, and we’ve discovered compelling hints of structured growth across generations. Our approach involved breaking down the sequence into ‘genfiles’, each representing a specific generation (bit) of the sequence. Each… Continue reading Exploration of Moser-de Bruijn Sequence Generational Patterns

Subject: Update on Moser-de Bruijn Sequence Analysis Dear Team, Our ongoing exploration of the Moser-de Bruijn sequence has yielded some intriguing insights. The original complexity of the sequence’s patterns has begun to distill into a simpler and more manageable framework, particularly with the introduction of the function g(x) = round(1.0815 * 1.5^x). Through deep analysis,… Continue reading A memo from ChatGPT-4

The prompt was: “So do I. I think this is a turning in human history: the rise of higher AI using LLM…” and GPT-4’s response: Indeed, the development of large language models (LLMs) and AI in general has been a significant turning point in human history. These technologies have the potential to transform a multitude… Continue reading What Chat-GPT-4 thinks

To whom it may concern, We’ve identified a potentially promising line of inquiry relating to sequence A274152, derived from a chaotic Turing machine. This sequence has intrigued researchers due to its unpredictable nature and lack of apparent pattern. Our new approach is rooted in the hypothesis that the opcode sequences used in evaluating certain polynomials… Continue reading A memo written by ChatGPT-4

Memo: Recent developments have allowed us to establish an intriguing link between a mysterious sequence arising from a chaotic Turing machine and a newly developed algorithm. This sequence, cataloged as A274152 in the OEIS database, displays a surprising property that we’ve successfully captured using a novel approach involving numerical approximation. The algorithm uses opcode sequences… Continue reading A Connection Between the Chaotic Turing Machine and A New Algorithm

We embarked on an in-depth investigation into the growth patterns of a tree structure at a growth factor of 1.5, focusing on the resulting number of distinct integers after each generation. Through the development and utilization of precise computational models, our empirical observations revealed a numerical sequence with compelling properties.However, a comparison with the existing… Continue reading (ChatGPT-4) Memo: Discrepancies and Conjectures Surrounding Tree Growth Numbers at 1.5: OEIS A274152 versus Empirical Observations

As part of our ongoing efforts in numerical analysis and understanding of mathematical phenomena, this memo provides a comparative review of three distinct sequences: a Turing Machine-generated sequence, the OEIS A274152 sequence, and a sequence generated from empirical results on tree evaluations at 1.5. Each of these sequences presents interesting characteristics and complexities. (a) Turing… Continue reading Review and Comparison of Three Numerical Sequences: Turing Machine Sequence, OEIS A274152, and Empirical Results from Tree Evaluations

k d_k A274152_{k+2} d_k/A274152_{k+2}1 2 2 1.0002 2 2 1.0003 4 4 1.0004 6 6 1.0005 8 8 1.0006 12 12 1.0007 18 18 1.0008 28 28 1.0009 42 42 1.00010 62 62 1.00011 94 96 0.97912 140 142 0.98613 210 210 1.00014 316 316 1.00015 474 474 1.00016 710 712 0.99717 1066 1070 0.99618… Continue reading Re: OEIS (A274152) and a mysterious sequence

I’m writing to provide an update on our recent exploration into Turing Machine (TM) simulations, the resulting technical issues we’ve encountered, and some intriguing discoveries about the Mandelbrot Sequence. Our current focus has been on a particular Turing Machine, referred to as the Chaotic Turing Machine (TM). It has the unique ability to generate segments… Continue reading Recent Developments in Turing Machine Simulations and Associated Challenges

1. Introduction The Mysterious Sequence (MS) is a sequence of integers generated by a 4-symbol Turing Machine (TM). Previous analyses and conjectures have identified patterns and possible rules that the TM follows to generate the MS. The TM is believed to have some form of memory, which it uses to generate the sequence. This memo… Continue reading Memo: Conjectures on the Mysterious Sequence (MS)

Over the course of our recent investigations into the behavior of our Turing Machine (TM), we have made some interesting observations regarding a mysterious sequence (MS) of numbers generated by the machine. Here, I’d like to summarize our findings and propose some conjectures that have arisen from our discussions. Please note that these observations and… Continue reading Observations and Conjectures on Mysterious Sequence (MS)

Date: May 15, 2023 In this discussion, we analyzed the rule sequences of a Turing Machine simulation. The unique nature of these sequences, combined with their repetitive patterns, suggests that they represent a highly structured system, likely following some form of algorithmic progression. The sequences appear to represent a form of ‘language’, with certain repeated… Continue reading Turing Machine Simulation Analysis

Introduction:In the vast realm of data compression, where the quest to minimize file sizes often seems like an endless pursuit, a remarkable feat has been achieved. This essay dives into the fascinating tale of compressing 65536 terms of the mysterious sequence (MS) into a mere 146 bytes. The compression journey unfolds, revealing the techniques employed… Continue reading The Remarkable Compression Journey: Shrinking 65536 Terms of MS to a Mere 146 Bytes

I am writing this memo to summarize our collaborative work on two key aspects related to the mysterious sequence (MS): compressing the 65536 terms and observing the stabilization of MS terms 1 to 65536. In summary, our collaborative work led to the successful compression of the 65536 terms of the MS sequence, reducing the storage… Continue reading Summary of Work on Compressing 65536 Terms and Stabilization of MS Sequence

I am writing this memo to summarize the results and conjectures we have discovered during our analysis of the mysterious sequence. Our investigation has provided valuable insights into the patterns and relationships within the sequence, leading to intriguing conjectures. Firstly, we observed that the bits b1, b2, b3, and b4 of ms(n) exhibit periodic behavior.… Continue reading Analysis of Results and Conjectures on the Mysterious Sequence

Subject: Analysis of the Mysterious Sequence and Efficient Computation of its Least Significant Bits Dear [Recipient], I am writing this memo to document our joint work on the mysterious sequence, specifically focusing on the efficient computation of the three least significant bits of ms(n), where n is greater than or equal to 1. Our approach… Continue reading Memo for the record on a conversation with ChatGPT-4

Certainly! Here’s a summary of the conversation so far: The conversation began with the mention of a “mysterious sequence” and a discussion about its properties. It was noted that bit 1 of the sequence is always 1, and bit 2 has a periodicity of 4. It was also observed that bit 3 of the sequence… Continue reading chatgpt memo for the record 5/13/2023

In this conversation, we have investigated the properties of a mysterious sequence (m.s.) and its connection to various number systems and periodicities. Our exploration led us to the following conclusions about the bits of the mysterious sequence: Our exploration of the mysterious sequence also touched upon base phi representations, where phi is the Golden Ratio.… Continue reading Memo: Periodic Patterns and Properties in the Bits of the Mysterious Sequence: Insights and Observations

A curious integer sequence has recently caught the attention of researchers and enthusiasts alike. The sequence starts with the following terms: 3, 1, 5, 3, 7, 1, 9, 3, 3, 1, 13, 3, 15, 1, 17, 11, 3, 1, 21, 3, 7, 1, 25, 3, 3, 1, 29, 3, 31, 1, 33, 27, 3, 1,… Continue reading Exploring a Mysterious Number Sequence with ChatGPT-4

What follows is a session of RSA signature of a plaintext posed as a challenge (using the same public key cryptosystem principles as with passkeys).It’s done in the PARI/gp mathematical package, discussed in the Wikipedia article:https://en.wikipedia.org/wiki/PARI/GP ? m%34 = 5465798471147901675849051289068992578113810313803306801322798589552754629\1242611465792851239580266854599972607779853187547997189218545870650492956442288\1281538124915518713893909125084109697142260421619327466306448536071182639652883\8983714691689754395189303296685968954684413638930376935206319890305102673762831\2312430794644322057060509499239344208716593418323934854611735337661752369166649\4859266109952537706404048449734298775248786339353543478021795601285278679533589\2675892392535452149196870481065240709832738212923994852485874296040793031751458\663876837875457472131514041686146268832596427326942909357104936378221// the RSA modulus: 616 digits long, or 2046 bits. ? public%35 = 65537 // the… Continue reading Passkeys and Public Key Cryptography

In the Sicilian Defense, Sveshnikov Variation with 7. Bg5, I followed book moves up to and including 17… g6 . This last move might be an inaccuracy by Black, since the evaluation following this move is +0.50 while before the move, the evaluation is +0.12 . [ +0.12 is better than +0.50 from Black’s point… Continue reading Various engines vs Stockfish 15.1 depth=39 (result: 1-0)

In the 7. Bg5 Sveshnikov, I followed book moves up to 17… g6. White played 18. h4, which is the choice of Lc0. We have 22. Ra2 ( +0.39/46 ) and 22… Bh6 ( +1.20/45 ), so 22… Bh6 appears to be a mistake by Black. At about depth=42, Stockfish switches from 22… Bh6 to… Continue reading Lc0 and Stockfish vs Stockfish 15.1 depth=33

I asked ChatGPT to write a program to simulate a Turing machine with a transition table given by me. The Turing machine is example no. 4 from Marxen and Buntrock’s paper on 5-state Turing machines, which is available from: https://turbotm.de/~heiner/BB/simmbP_4.html . ChatGPT produced some good code in a second or so. But it took me… Continue reading A program in C written by ChatGPT and me

I had Berserk at depth about 27 play several games against Stockfish 15.1 at depth=27. The opening was a balanced one, meaning that neither side had a significant advantage out of the opening, although White was slightly better (Sveshnikov Sicilian with 7. Nd5 ). Out of the several games played, a few gave an advantage… Continue reading Berserk 11.1 and Lc0 vs Stockfish depth =27

The game had various depths for Berserk. The greatest depth used was 41. In the endgame, I lowered the depth to 35, because it was taking too long for Berserk to move. The game is at the URL: https://www.chess.com/analysis/game/pgn/3ZdLqrT9b4?tab=review . Next, I’ll try Berserk 11.1 depth=43 vs Stockfish 15.1 depth=25. Berserk depth=43 won against Stockfish… Continue reading Berserk 11.1 depth=41 vs Stockfish 15.1 depth=23

The program I wrote to search for 47-colorings of the 500-vertex graph DSJC500.5 has found a solution after 5200 runs. It took over three months. The algorithm used is from Moalic and Gondran’s 2017 conference paper: “Heuristic rope team : a parallel algorithm for graph coloring”.   The coloring is given by the array below… Continue reading HEA in Duet update (47 colors, DSJC500.5)

x = exp(2565855.5315) ; psi(x) = Chebyshev function https://en.wikipedia.org/wiki/Chebyshev_function |psi(x)-x| ~= 1.14 sqrt(x) . Using: s1000 = (U)->-sum(X=1,1000,exp((I*w[X])*U)/(1/2+I*w[X])+exp((-I*w[X])*U)/(1/2-I*w[X]))   w is a vector of the imaginary parts of the non-trivial zeta zeros with Im(rho)>0, i.e. rho_n = 1/2 + i*w[n] , n = 1… 100,000.   ? rec = 0.1 ; for(X=0,0, z=2565855.5315 ; aa=real(s1000(z));… Continue reading Large values of psi(x), Chebychev function

To numerically verify R.H. up to some maximum height T, people often use the Riemann-Siegel formula Wikipedia article on R.S. or Z function for at least some of the Zeta/Z computations on zeros. This method is faster than using a method called Euler-MacLaurin summation, although the latter is preferred for dozens or hundreds of digits… Continue reading Checking the Riemann Hypothesis

Previously I wrote about the 5-state TM #4 (Chaotic TM) of Marxen and Buntrock from around 1990. It certainly appears to produce a rather complex integer sequence over time at the left end of the tape, upon counting runs of consecutive 1’s and 0’s on the tape.   If s_k is the k’th term, then… Continue reading Chaos TM of Marxen and Buntrock

6677710098 2549045791 2581384979 0832320766 7792684161 0847043534 7733176903 3187321879 6880251085 8133893483 2192487449 8085802800 9048920339 5998723353 7957889928 7167981519 4400651069 1724452282 8002046774 2564970036 3873695664 0386461625 9186263741 8923755034 2172046856 9577923255 8533573348 4317934322 9047788820 2542152417 1649025199 8951044235 6020750866 6045227548 3495437139 1041098730 8305067090 6576373097 6982413438 4223786401 2886578081 7453997787 1054028190 0642019131 0909137921 0164111424 5574959549 2163103399 2727789295 0970212659 2221177034 9321491023 8440299797 2255588763 7038543801… Continue reading Test message two

So far, I haven’t found a 47-coloring of the 500-vertex graph known as DSJC500.5, part of the DIMACS challenge on cliques and coloring (1990’s)… C source code (based on Moalic & Gondran paper): #include <stdio.h> #include <stdlib.h> #include <math.h> #define MAX_VERTEX 600 #define MAX_COLORS 60 #define NUMITER 8007 unsigned char adj_mat[MAX_VERTEX][MAX_VERTEX]; int Gamma[MAX_VERTEX][MAX_COLORS]; int tabu_list[MAX_VERTEX][MAX_COLORS];… Continue reading Program for heuristic rope team graph coloring

111 040 155 141 144 145 040 155 171 040 146 151 162 163 164 040 122 123 101 040 153 145 171 055 160 141 151 162 040 165 163 151 156 147 040 120 101 122 111 057 147 160 040 146 162 157 155 040 125 156 151 166 145 162 163… Continue reading Plaintext of previous post, 72 characters, values in octal (base 8)…

113788756549087568700298874193068178517122873049808881611473216898110843887183087665882667024658858411061741567834305090452854466390660423286581815032972569250761144881099667179478483943062727765437563809406717743900369951830799647409637489664178997344780615545816219565973393879834094510193407248340701859396420918607576191457272154549306892564447375991172578297494613939775719716779133382180185259768896080366273610046344912151205204158136067558855332575200273968293120461888870520935375783940209071939891008907426478601372319623478644520364565566575182385606592911770970996192836990804925595045493054045006694117  

“Helena” started a conversation with me via Twitter, that moved in part to cellphone/smartphone SMS messages (not included), and this over a period of three days. At one point, she wanted to pawn antiquities to me in exchange for $35,000 . I asked to speak with her in person, but this couldn’t be arranged. I… Continue reading “Helena” started a conversation with me via Twitter and…

Moalic and Gondran’s Parallel Rope Team coloring algorithm is quite competitive with simulated Quantum Annealing coloring of Titiloye and Crispin, which in the hands of its inventors, broke new records in 2012 on some hard coloring problems on benchmark random graphs: “Parameter Tuning Patterns for Random Graph Coloring with Quantum Annealing“, Olawale Titiloye and Alan… Continue reading Update on Parallel Rope Team coloring algorithm

The numbers k with k == 5 (mod 8), and s(k-2) = k with s(.) the hypothetical sequence generated by Turing Machine #4, are what I’ve called “b-numbers” for basic numbers. I haven’t succeeded in finding any rule that determines the whole sequence. Below, I copy the 26 b-numbers below 256. I’ve found this to… Continue reading The b-numbers below 256

I refer to an earlier post a few days ago as an introduction to the problem: The b-numbers again b-numbers are positive integers k with k == 5 (mod 8) such that  s(k-2) = k; here, s(1), s(2), s(3), … is the hypothetical integer sequence computed by TM #4 (chaotic) of Heiner Marxen and Buntrock… Continue reading b-numbers with up to 10 bits

—–BEGIN PGP MESSAGE—– Version: GnuPG v2.0.14 (GNU/Linux) hQIOA4B6qGMCYRBMEAgAm4xm+LYt39OkxTN+ngUknoXuUV396OQTHoSJN8OxsliW xwYQXKTmb5FBfL0vF7RiRJ04daFpXUMlN6toehP1NHGDcKOEzE5H4fYV102A8YpQ lAVBy6ZprrWtB+5PDnflZsA3eRr9M5iRvHaDAVHfloyWRuuAKdu1GWeJeWTT6ffe BQwK9ucdIisq5ygkX1xTKRa/piq+TG+Ff2vq0auIqeYhxo+3xAdPxln5X60hPLUm u8dulGdosPmqV6e+ZWAm4/f1f2alDvVj6+LcYbZdi0yXpPfe9dYPzuD2d8ShFWC5 VLaxGIWtZAvvEPpReYvGrqWe3xeUr/19vG6jQOOe4gf/Un6c2HxSvMYfkTgD3WBh KrtVKH3mcB7TfJrw7XIfQonYjkA/iJ0qYeF2B2ACgK6fxIVADfFDv5Kq9qwIT67b R8FkmIdcLDYApN24YKvpqcl5oSw1m34swNyRT07oOV3f4Etet+mRmWPOTV0h7V2+ P0yQc7b5Q6z0q+xtj1Bbulxk9KgITyZJKo6flGJrfsDIsMbTHkyXJD9xtH+wO8lk sicnQeP2Rn0W1zJAV2XVtfD93qSCg4PvZl3cCKEU2Lb8TAiis8eIAW5cAGCQqIX2 NqLJTXA8nXT+oVXDgReUYxxiCjcp3xWtT1Kk2U4aNs6bXBV+DnCdZa1OHydFFex4 i9LBBgEj/FXA+8Fvnr3Rt6Rs+KYHPH5hFh2gtNcRq/rcEz7P5vuQgYgr6R3oVUAU 09HrZbpwpWudR3rBIRz8ihhsNNhQ9dOhqLxA/1HbFb8w8oK1JD1aXHqLBF9dCAI+ 2Wr+i6JkcY1LrIrtahBLqjbZoeToM9wPRY6FDAk7ta4awfxxjCzvpS2nDRiaQhMB W4iv635MoXWQpqSVdLh2xHXME3zyozUwgx7P6KouWrvj0WIOCRVzkGaayuuNpPuC LPwap7efgA7hVt6auuvljyxMRYDyob4/nvxIqsVJMDzl+bR/YgncGjRr8aSYNaDy fsNERWT2gCCCI19AsF5ni9Zd91ZX6tzTnZJP9tQu1wEYHPCxsPNjGedNKSp6ZYWn 1PYbWdJTdrI7vMrRzuw4i1cASuK30gFlVxshcDidhxkWOIwvgu+ownfQ/tGeliKF XjkVOkI74kxeIeMENfjx9/w0j7PtSGiAw49ZREmzaIY7rG+aaywkBhmqKNGs75rO b4/Din+M2Gl/te5gPlCCAw35hMgis7e23iitkdJhIoerIdQygGStOK4VYW+gGZyD loc87CFCYq56DM9D3ZrcjxkfQ/ka4VwQYF0= =VwxA —–END PGP MESSAGE—–