benchmarks.wiki

benchmarks.wiki / Public workspace

MMLU-Pro / 10418 / Let M be a single-tape, deterministic Turing machine with tape alphabet…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

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?
I. The computation C lasts for at least n steps.
II. The computation C lasts for at least n steps, and M prints a 1 at some point after the nth step.
III. M scans at least n distinct tape squares during the computation C.

category

computer science

options

  1. III only
  2. II and III only
  3. Only when M prints a 1 at some point before the nth step.
  4. I only
  5. All are decidable
  6. I and II only
  7. None
  8. II only
  9. I, II, and III
  10. I and III only

src

ori_mmlu-college_computer_science

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

upstream_id / Original problem ID
10418
task_id
98f455c6-9145-5638-b66a-243c72c20a2a
task_key
default--test--10418
task_revision_id
1
config / split
default / test

Official source

initial import