{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003456346,0.0008331736,0.0009595522,0.001117109,0.004368511,0.002966487,0.001768471,0.002905446,0.01095733],"category_scores_gemma":[0.01718321,0.0005264058,0.003116807,0.001092699,0.007922568,0.01542732,0.004292031,0.01165541,0.001686978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002338278,"about_ca_system_score_gemma":0.002615962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001873522,"about_ca_topic_score_gemma":0.001050899,"domain_scores_codex":[0.9954509,0.001388223,0.0002869449,0.00127086,0.001228991,0.0003740151],"domain_scores_gemma":[0.9844925,0.01140488,0.0005494184,0.001744128,0.001465123,0.0003438907],"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.00003373727,0.00001711226,0.0002206805,0.0002392412,0.0000254402,0.0001500362,0.0001830362,0.0008926878,0.0004437534,0.9740183,0.01248152,0.01129454],"study_design_scores_gemma":[0.0000219611,0.00002294543,0.0001677577,0.0000403655,0.00002110372,0.000230365,0.00005961442,0.005302666,0.001212915,0.970736,0.02216869,0.00001563813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0207764,0.003923315,0.777098,0.06219174,0.004508504,0.0002608741,0.0009047483,0.0008619422,0.1294744],"genre_scores_gemma":[0.6449986,0.005583866,0.2880068,0.025914,0.004528267,0.001574365,0.001105486,0.000684384,0.02760429],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01095733,"threshold_uncertainty_score":0.0366559,"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."}}