{"id":23491918,"url":"https://github.com/jonathanstarup/tally-clustering","last_synced_at":"2026-03-27T00:34:48.725Z","repository":{"id":109809460,"uuid":"587447225","full_name":"JonathanStarup/tally-clustering","owner":"JonathanStarup","description":"An exploration of computational complexity in tally clustering","archived":false,"fork":false,"pushed_at":"2023-01-11T16:28:18.000Z","size":6,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2026-02-06T08:44:02.636Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/JonathanStarup.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.md","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":"2023-01-10T19:18:55.000Z","updated_at":"2023-01-11T08:20:40.000Z","dependencies_parsed_at":"2023-05-26T13:45:52.477Z","dependency_job_id":null,"html_url":"https://github.com/JonathanStarup/tally-clustering","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/JonathanStarup/tally-clustering","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JonathanStarup%2Ftally-clustering","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JonathanStarup%2Ftally-clustering/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JonathanStarup%2Ftally-clustering/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JonathanStarup%2Ftally-clustering/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/JonathanStarup","download_url":"https://codeload.github.com/JonathanStarup/tally-clustering/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JonathanStarup%2Ftally-clustering/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31003864,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-27T00:15:12.539Z","status":"ssl_error","status_checked_at":"2026-03-27T00:14:54.741Z","response_time":114,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":"2024-12-25T01:43:29.743Z","updated_at":"2026-03-27T00:34:48.685Z","avatar_url":"https://github.com/JonathanStarup.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# Tally Clustering\nAn exploration of computational complexity in tally clustering.\n\n\n# Introduction\nHow do you keep a running count of things in writing? It might be about keeping\ntrack of how many rounds you've knitted, how many cups of office coffee you've\nhad, or how many red cars have gone past.\n\n[Wikipedia](https://en.wikipedia.org/wiki/Tally_marks) has some information on\nit and there's many ways to do it. The most common method I've seen is the one\nwhere you count by adding vertical lines unless its a multiple of five, then you\nadd a horizontal or diagonal bar to cover the previous four.\n\n    place image here of \"ordinary\" tally (maybe also the others a la wiki)\n\nOther methods listed on the Wikipedia page includes prettier systems but that are functionally the same, either clustering tallies in fives or tens.\n\nAnother approach is roman numerals...\n\n    place image here of roman tallying\n\nAnother approach is normal counting, written down. With this method you write the full number of the count at each update. This means that you don't use any of the existing writing on the paper. This means that it almost does count as a tally system but I'll include it anyway since its the way that computers count.\n\n    place image here of regular counting as tally\n\n# License\n\nCopyright 2023 Jonathan Lindegaard Starup\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjonathanstarup%2Ftally-clustering","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjonathanstarup%2Ftally-clustering","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjonathanstarup%2Ftally-clustering/lists"}