<commit_before><commit_msg>Initial commit<commit_after>BoltzmanMachine
===============

The traveling salesman problem(TSP) was computed using a modi
ed version of the Boltzmann machine. By having a matrix which represents the distances between cities and having an initially randomly generated binary activation matrix. Having this matrix and a user de
ned temperature, bonus and penalty we compute the delta c and the probability of acceptance. We then compare the probability of acceptance with a randomly generated number and if the number is less than the probability of acceptance we change that element in the activation matrix to the opposite. We repeat this process for every element in the activation matrix randomly and then decrease the temperature by 5 per cent. We continue doing this until the temperature falls bellow a user de
ned threshold. Then we acquire our local minimum distance traveled and the activation matrix. This process is repeated 10,000 times and from this we pick our best result which is our outputted minimum.
{'fraction_non_alphanumeric': 0.031578947368421054, 'fraction_numerical': 0.005741626794258373, 'mean_word_length': 5.226190476190476, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '2664908', 'n_tokens_mistral': 213, 'n_tokens_neox': 201, 'n_words': 158}