{"id":24525985,"url":"https://github.com/otheec/tilo","last_synced_at":"2025-03-15T15:41:06.734Z","repository":{"id":261974248,"uuid":"867768667","full_name":"otheec/TILO","owner":"otheec","description":"Teoretical CS","archived":false,"fork":false,"pushed_at":"2024-12-13T22:36:33.000Z","size":79,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-22T05:31:47.153Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/otheec.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-10-04T17:22:56.000Z","updated_at":"2024-12-13T22:36:36.000Z","dependencies_parsed_at":"2025-01-22T05:29:33.148Z","dependency_job_id":"d286171d-2cdd-4944-b038-516bfe08fa27","html_url":"https://github.com/otheec/TILO","commit_stats":null,"previous_names":["otheec/tilo"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/otheec%2FTILO","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/otheec%2FTILO/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/otheec%2FTILO/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/otheec%2FTILO/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/otheec","download_url":"https://codeload.github.com/otheec/TILO/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243753989,"owners_count":20342537,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2025-01-22T05:29:26.249Z","updated_at":"2025-03-15T15:41:06.711Z","avatar_url":"https://github.com/otheec.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# TILO\n\n\u003ca href=\"https://sites.google.com/view/7tilo-xtilo/home\"\u003e7TILO website\u003c/a\u003e\n\n## Overview\nTILO is a collection of Computer Science excercises\n\n## Projects\n\n### 1. **Turing Machine for Addition**\n   This project implements a single-tape Turing machine that performs binary addition of two numbers.\n\n   **Key Features:**\n   - The machine operates on a binary string that includes two numbers separated by a `+` symbol.\n   - The Turing machine processes the binary input and outputs the sum of the two binary numbers.\n   - Designed to follow the traditional rules of a Turing machine, including reading, writing, and moving along the tape.\n\n   **Example:**\n   - Input: `101 + 11`\n   - Output: `1000` (5 + 3 = 8 in binary)\n\n### 2. **Multiple Tape Turing Machine**\n   This project demonstrates a more complex, multitape Turing machine, which can operate simultaneously on multiple tapes to increase efficiency for specific tasks.\n\n   **Key Features:**\n   - Multiple tapes allow for parallel processing, reducing the number of steps required for complex computations.\n   - Each tape operates independently, but they interact through the machine’s control mechanism.\n   - This implementation can be extended to handle more sophisticated tasks than a single-tape machine.\n\n   **Use Cases:**\n   - Suitable for more complex algorithms that require the division of tasks across tapes.\n   - Can be applied to more advanced operations such as multiplication or language recognition problems in computational theory.\n\n### 3. Binary Comparison Function (foo)\n\nThis project implements a Turing machine that compares two binary numbers `x` and `y` and returns `1` if `x \u003e y`, and `0` otherwise.\n\n#### Function Definition\n- **foo(x, y)**: Outputs `1` if `x \u003e y`; otherwise, outputs `0`.\n- **Inputs**: Two binary numbers separated by `+` (e.g., `x+y`).\n- **Alphabet**: `{0, 1, +}`.\n\n#### Steps\n1. **Design the Turing Machine for Comparison**: Define the Turing machine’s states and transitions to compare two binary numbers separated by `+`.\n2. **Implement Transition Functions**: Write the specific transition rules needed to perform the comparison operation.\n3. **Enhanced Simulation Features**:\n   - **Custom Simulation**: Simulate the comparison Turing machine created in step 1.\n   - **Binary Encoding of Turing Machines**: Allow encoding of machine structure in binary format for easy interpretation by the simulator.\n   - **Binary Code Conversion**: Convert binary-coded Turing machine structures into a format usable by the simulator.\n\n### 4. Graph Traversal\n\nThis program evaluates nodes in a weighted, connected graph with edges requiring resources to traverse. The goal is to maximize resource gain (`z`) while adhering to a set budget (`r`).\n\n### Problem Description\n- **Input:** A graph of evaluated nodes connected by weighted edges.\n- **Output:** For each step `t`, the program outputs the state `r`, `z`, along with the edge and node used\n\n### 5. **Minimum Spanning Tree Algorithms**\nImplementation and comparison of Kruskal's, Jarnik's (Prim's), and Borůvka's algorithms to find the MST of a graph.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fotheec%2Ftilo","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fotheec%2Ftilo","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fotheec%2Ftilo/lists"}