{"id":"W3041167053","doi":"10.5539/jmr.v12n4p1","title":"A Proof “P≠NP” for P vs. NP Problem by Multiple-Tape Turing-Machine","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Turing machine; Mathematics; NP; Universal Turing machine; Time complexity; P versus NP problem; Complexity class; PSPACE; Time hierarchy theorem; Computational complexity theory; Homogeneous; Discrete mathematics; Structural complexity theory; Combinatorics; Running time; Algorithm; Computation","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00535361,0.0002180773,0.0005660518,0.0002560148,0.0002131407,0.0004325636,0.00274678,0.0001018406,0.00002827842],"category_scores_gemma":[0.003692764,0.0001653438,0.0002418069,0.00074304,0.0001240846,0.0004766812,0.001013497,0.0009613266,0.00002643547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001509478,"about_ca_system_score_gemma":0.0003075066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000078822,"about_ca_topic_score_gemma":0.000004375634,"domain_scores_codex":[0.9957477,0.0002688021,0.001018741,0.0003969606,0.001900605,0.0006671927],"domain_scores_gemma":[0.994386,0.00277067,0.0004418826,0.0005715713,0.001358761,0.000471085],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001163681,0.01702145,0.005250024,0.01780767,0.001409278,0.000788849,0.05890228,0.008438139,0.06038325,0.04002461,0.5343291,0.2544817],"study_design_scores_gemma":[0.001981583,0.002260522,0.00006555435,0.0001746477,0.00001536862,0.0002836934,0.0001163219,0.9003847,0.00894739,0.07033466,0.01512896,0.000306558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01140081,0.000583556,0.9634558,0.02271314,0.0001483816,0.001265803,0.00001999989,0.00006253915,0.0003499771],"genre_scores_gemma":[0.200511,0.00004309458,0.7984931,0.0002791405,0.0003785743,0.00004984961,0.000001682874,0.00004170802,0.0002018206],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8919466,"threshold_uncertainty_score":0.6742523,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1180571788179516,"score_gpt":0.3672792655202723,"score_spread":0.2492220867023207,"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."}}