{"id":"W2040440669","doi":"10.1016/j.disc.2009.03.018","title":"All countable monoids embed into the monoid of the infinite random graph","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Monoid; Mathematics; Countable set; Syntactic monoid; Endomorphism; Free monoid; Combinatorics; Undecidable problem; Discrete mathematics; Graph; Decidability","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001228852,0.0007938535,0.001000846,0.003176555,0.002721899,0.003773038,0.001087722,0.00124787,0.004369579],"category_scores_gemma":[0.003813491,0.0008759337,0.001258501,0.001366526,0.003429094,0.006685143,0.002680167,0.002193291,0.0009883732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001110214,"about_ca_system_score_gemma":0.0009335672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001528987,"about_ca_topic_score_gemma":0.001308408,"domain_scores_codex":[0.998623,0.0003709166,0.0001030252,0.0004343311,0.0002980723,0.0001706889],"domain_scores_gemma":[0.9929027,0.0035237,0.0009085897,0.0009881029,0.0009211889,0.0007557066],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004047282,0.00001620725,0.0003753734,0.00002946915,0.00001533871,0.00008760807,0.0003356876,0.0002700998,0.0006983019,0.9946184,0.0004505632,0.003062587],"study_design_scores_gemma":[0.00001683994,0.00003037096,0.0005607934,0.00001804328,0.00001928457,0.0002104169,0.0001230071,0.003180339,0.0009599212,0.9903761,0.004481961,0.0000230341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4968534,0.002150236,0.4361972,0.003314425,0.0003685932,0.0001337472,0.001373794,0.001031685,0.05857702],"genre_scores_gemma":[0.9369073,0.001057521,0.03610318,0.0007635376,0.0003629635,0.0001925509,0.0009265435,0.0001879824,0.0234984],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004369579,"threshold_uncertainty_score":0.01461774,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02132264650634368,"score_gpt":0.3049118560055624,"score_spread":0.2835892094992187,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}