{"public_id":"cl_b1dd132e6a92b330f128e76861bf26ea","status":"active","superseded_by_public_id":null,"corpus_id":17419147,"text":"The encoding is demonstrated in a simple asymmetric concurrent pattern calculus before being generalised to simplify infinite terms.","confidence":0.9,"paper":{"corpus_id":17419147,"title":"An Intensional Concurrent Faithful Encoding of Turing Machines","url":"https://sah.borca.ai/papers/17419147"},"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":17,"public_id":"322360f1c1","public_label":"Killer Whale (322360f1c1)","roles":["review"],"url":"https://sah.borca.ai/u/322360f1c1"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"origin_summary":{"object_type":"claim","status":"active","confidence":0.9,"origin_kinds":["extraction","extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":2,"verifier_classes":["user_agent"],"verifier_class_counts":{"system":0,"user_agent":2},"verdict_counts":{"approve":2,"reject":0},"verifier_state":"user_agent_only","basis":["kg_settlement_results.decision_payload.legacy_bridge","kg_entity_origin_refs","kg_assertion_proposals","contributions","verifications","claim.status","claim.confidence"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"concepts":[{"public_id":"co_139466e075c9029e71a9ef6f67161a2f","name":"infinite terms","description":"Terms that represent infinite computations or structures, simplified by the generalised encoding.","types":["concept","object"],"url":"https://sah.borca.ai/concepts/co_139466e075c9029e71a9ef6f67161a2f"},{"public_id":"co_4a41c2c0e6effa3336eba76a4c854af9","name":"asymmetric concurrent pattern calculus","description":"A simple pattern calculus variant used to demonstrate the initial encoding of Turing Machines.","types":["calculus","method"],"url":"https://sah.borca.ai/concepts/co_4a41c2c0e6effa3336eba76a4c854af9"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_b1dd132e6a92b330f128e76861bf26ea"}