Upload dataset.json with huggingface_hub

dataset.json

@@ -116,13 +116,13 @@
   {
     "homework": "hw5",
     "exercise_number": "2",
-    "content": "(30') Let language\n\n$$L = \\{0^n : n \\text{ is a Fibonacci number}\\}.$$\n\nDesign a Turing machine that decides L. Draw the state diagram of the corresponding Turing machine and submit its source code on eLearning.",
+    "content": "Let language\n\n$$L = \\{0^n : n \\text{ is a Fibonacci number}\\}.$$\n\nDesign a Turing machine that decides L. Draw the state diagram of the corresponding Turing machine and submit its source code on eLearning.",
     "full_id": "hw5_ex2"
   },
   {
     "homework": "hw5",
     "exercise_number": "3",
-    "content": "(40') In the definition of the Turing machine, the head can move left or right. A Turing machine whose head can move left, right, or stay in place is called a *Turing machine with a stationary move*, or more formally:\n\n$$\\delta : Q \\times \\Gamma \\to Q \\times \\Gamma \\times \\{L, R, S\\}.$$\n\nProve that if a language $L$ can be decided by a Turing machine with stationary moves, then $L$ can also be decided by a standard Turing machine.",
+    "content": "In the definition of the Turing machine, the head can move left or right. A Turing machine whose head can move left, right, or stay in place is called a *Turing machine with a stationary move*, or more formally:\n\n$$\\delta : Q \\times \\Gamma \\to Q \\times \\Gamma \\times \\{L, R, S\\}.$$\n\nProve that if a language $L$ can be decided by a Turing machine with stationary moves, then $L$ can also be decided by a standard Turing machine.",
     "full_id": "hw5_ex3"
   },
   {
@@ -140,7 +140,7 @@
   {
     "homework": "hw6",
     "exercise_number": "3",
-    "content": "(30') Prove the number of multitape Turing machines is countable.",
+    "content": "Prove the number of multitape Turing machines is countable.",
     "full_id": "hw6_ex3"
   },
   {