{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"mmlu","formal_name":"MMLU","introduction":"MMLU asks four-way multiple-choice questions across 57 subjects, from elementary material to professional-level examinations. Since 2020 it has been the most widely cited single reference point for general capability.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/hendrycks/test","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"17e2c086-9bb1-5465-b451-21c9734a7b39","task_key":"all--test--17e2c086-9bb1-5465-b451-21c9734a7b39","task_revision_id":"1","upstream_id":"","short_description":"Let M be a single-tape, deterministic Turing machine with tape alphabet…","config":"all","split":"test","body":"{\"choices\":\"['None', 'III only', 'I and II only', 'I and III only']\",\"question\":\"Let M be a single-tape, deterministic Turing machine with tape alphabet {blank,0,1}, and let C denote the (possibly infinite) computation of M starting with a blank tape. The input to each problem below is M, together with a positive integer n. Which of the following problems is (are) decidable?\\nI. The computation C lasts for at least n steps.\\nII. The computation C lasts for at least n steps, and M prints a 1 at some point after the nth step.\\nIII. M scans at least n distinct tape squares during the computation C.\",\"subject\":\"college_computer_science\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/test","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}