From 50d1c5e2558c9dc81efb5e0c41930f96627a9e66 Mon Sep 17 00:00:00 2001
From: udlbook <110402648+udlbook@users.noreply.github.com>
Date: Thu, 12 Oct 2023 18:42:59 +0100
Subject: [PATCH] Created using Colaboratory

---
 Notebooks/Chap03/3_3_Shallow_Network_Regions.ipynb | 13 ++-----------
 1 file changed, 2 insertions(+), 11 deletions(-)

diff --git a/Notebooks/Chap03/3_3_Shallow_Network_Regions.ipynb b/Notebooks/Chap03/3_3_Shallow_Network_Regions.ipynb
index 78fd1ea..f83b14a 100644
--- a/Notebooks/Chap03/3_3_Shallow_Network_Regions.ipynb
+++ b/Notebooks/Chap03/3_3_Shallow_Network_Regions.ipynb
@@ -4,7 +4,7 @@
   "metadata": {
     "colab": {
       "provenance": [],
-      "authorship_tag": "ABX9TyMz9rFbtPS4OjnNgB38OY68",
+      "authorship_tag": "ABX9TyMdflMfWi9hu9ZEg/80HCd8",
       "include_colab_link": true
     },
     "kernelspec": {
@@ -115,7 +115,7 @@
     {
       "cell_type": "markdown",
       "source": [
-        "This works but there is a complication. If the number of hidden units $D$ is fewer than the number of hidden dimensions $D_i$ , the formula will fail.  When this is the case, there are just $2^D$ regions (see figure 3.10 to understand why).\n",
+        "This works but there is a complication. If the number of hidden units $D$ is fewer than the number of input dimensions $D_i$ , the formula will fail.  When this is the case, there are just $2^D$ regions (see figure 3.10 to understand why).\n",
         "\n",
         "Let's demonstrate this:"
       ],
@@ -254,15 +254,6 @@
       },
       "execution_count": null,
       "outputs": []
-    },
-    {
-      "cell_type": "code",
-      "source": [],
-      "metadata": {
-        "id": "LRoF6zQN9b_y"
-      },
-      "execution_count": null,
-      "outputs": []
     }
   ]
 }
\ No newline at end of file