Chatgpt 新體驗與實測
最近很紅的chatgpt,簡單來說就是個聊天機器人,但是是很厲害的ai,等等會來(聽他)介紹他,可以回答很多各種不同的問題,還會寫程式,等等會來實測,紅到有時候上面太多人,要等一下才能玩,話說他已經出付費版了,而且據說他還是google殺手,被學生拿來寫心得,文章品質明顯勝過唬爛產生器,讓人無法分辨是不是真人寫的,甚至可以通過大學考試。
以下是他的豐功偉業的文章
- https://technews.tw/2023/02/04/chatgpt-passes-exams-from-top-universities/ 通過大學考試
- https://www.cool3c.com/article/188936 google殺手
- https://tw.news.yahoo.com/%E9%9D%A0chatgpt%E4%BB%A3%E5%AF%AB%E4%BD%9C%E6%A5%AD-%E6%95%99%E5%B8%AB%E6%86%82%E5%AD%B8%E7%94%9F%E8%A2%AB%E8%AA%A4%E5%B0%8E-121600651.html 被用來代寫作業
實測
接下來進入實測環節了,先來請他做自我介紹,可以用中文跟英文,不過他應該用英文比較聰明,因為英文的資料比較多。
我:自我介紹
chatgpt:你好,我是ChatGPT是OpenAI開發的一種語言模型。我受過訓練,可以根據輸入回答問題和生成文本。有什麼可以幫到你的嗎?
數學
這次更新官方說會改善他的數學能力,我來測試一下
小學程度
簡單四則
我:(2+3)*4
chatgpt: The expression (2+3)*4 equals 20.
##### 面積
我:直徑為10的圓形 面積多少
chatgpt::直徑为 10 的圆形的面积是约为 78.53975 平方单位,可以使用以下公式计算:π * (半径^2) = π * (10/2)^2 = π * 5^2 = 78.53975。
他有時候會輸出簡體字,應該是訓練資料的原因吧。
代數
我:solve for x in the equation ((x+2)*4-7=20)
chatgpt:Here’s one way to solve for x in the equation ((x+2)*4-7=20):
- Start by expanding the expression inside the parentheses: (x+2)*4 = 4x + 8.
- Substitute this expression back into the original equation: 4x + 8 - 7 = 20.
- Simplify the left side of the equation: 4x + 1 = 20.
- Subtract 1 from both sides: 4x = 19.
- Finally, divide both sides by 4 to find x: x = 19/4 = 4.75.
So, the solution to the equation is x = 4.75.
看起來還蠻靈光的
國中程度
##### 代數(因式分解)
我:find all factor of x^16-1
chatgpt:
The expression x^16 - 1 can be factorized into the following product of irreducible polynomials over the field of complex numbers:
x^16 - 1 = (x-1)(x+1)(x^(2) +1)(x^ 4+1)(x^8+1).
This factorization can be obtained by using the identity x^n - 1 = (x-1)(x^(n-1) + x^(n-2) + … + x + 1) and the factorization of x^2 + 1 = (x+i)(x-i) where i is the imaginary unit.
幾何(二次曲線)
chatgpt:
To find the extreme (minimum or maximum) of the function f(x) = x^2 + 4x + 5, you can use the second derivative test or complete the square method.
Using the complete the square method:
- Rewrite the function as f(x) = (x^2 + 4x) + 5.
- Add and subtract the square of half the coefficient of the x term inside the parentheses: f(x) = (x^2 + 4x + 4) + 1.
- Factor the expression inside the parentheses: f(x) = (x + 2)^2 + 1.
The expression inside the parentheses is a perfect square, so it reaches its minimum value of 1 when x = -2. Therefore, the minimum value of the function is f(-2) = 1.
Alternatively, using the second derivative test:
- Take the derivative of the function: f’(x) = 2x + 4.
- Take the second derivative of the function: f’’(x) = 2.
- Since the second derivative is positive, the function has a minimum value. To find the x-value at which the minimum occurs, set the first derivative equal to zero and solve for x: 0 = 2x + 4, x = -2.
So, the minimum value of the function is f(-2) = 1.
給了一個配方法,一個微積分的方法。
幾何
我:對於給定的三角形 (a=10 b=6 c=8) 外心與其頂點之間的距離是多少
chatgpt :
三角形的外心是經過三個頂點的圓的中心。可以使用以下公式計算外心和三角形頂點之間的距離:
d = R * cos(A/2),
其中 R 是外接圓的半徑(外接圓的半徑),A 是頂點和相對於該頂點的邊的中點之間的角度。
計算外接圓的半徑,可以使用以下公式:
R = (abc) / (4K),
其中 K 是三角形的面積,abc 是三角形的邊長。
填入三角形邊長的給定值,我們有:
K = (1/2)bh = (1/2)(6)(10) = 30 平方單位。
R = (abc) / (4K) = (10 * 6 * 8) / (4 * 30) = (480) / (120) = 4。
對於一個頂點,假設頂點 A,可以使用余弦定理找到角 A/2:
cos(A/2) = (b^2 + c^2 - a^2) / (2bc) = (36 + 64 - 100) / (2 * 6 * 8) = 0。
因此,d = R * cos(A/2) = 4 * 0 = 0。
因此,三角形的外心和頂點 A 之間的距離為 0。
這次他出錯了,那個三角形又不是一個點,外心到頂點的距離怎麼可能是0,我猜可能要說外接圓她才聽得懂,因為他也寫出area=abc/4r 這個東西。
不過真的有進步了,不然之前他連超過100的加減法聽說都不會。
產生心得
常常要交一些莫名其妙的心得報告的學生有福了。
我的夢想
我:以我的夢想為題,產生一個600字的作文
chatgpt:
我的夢想是成為一名心理學家。我一直以來都對人的心理和行為感興趣,並希望能夠幫助人們解決他們的心理問題。
我相信,通過了解人的心理狀態和行為,我可以幫助他們找到他們的快樂和幸福。當然,解決心理問題並不是一件容易的事,但我深信我有能力做到。
我知道,實現這個夢想需要付出巨大的努力和決心。我已經開始了我的學習,並且我正在努力學習心理學,以更好地了解人的心理和行為。我還在通過不斷阅读和研究心理学相关的资料来拓展我的知识面。
在未來,我希望能够通過我的工作為那些需要幫助的人提供支持。我想要建立一個安全的環境,讓人們可以對我們談論他們的困難,並得到我的幫助和支持。我希望我的工作能夠對人們的生活產生真正的影響,並幫助他們找到快樂和幸福。
總而言之,我的夢想是成為一名心理學家,幫助人們解決他們的心理問題,並使他們的生活更加快樂
雖然沒有600字,不過應該是字數有限制,我之前有問過他,他說回答字數有限制,為了避免資源耗盡。看起來還算可以,中規中矩,他的文章向來都是中規中矩。
chatgpt:
I recently attended a lecture that left a lasting impression on me. The speaker was incredibly knowledgeable and articulate, and their passion for the topic was palpable. They spoke about the importance of hard work and perseverance, and how these qualities can lead to success in any field.
One of the most impactful moments of the lecture came when the speaker shared their own personal story of struggle and triumph. They talked about the obstacles they faced and how they overcame them through sheer determination and a never-give-up attitude. This was truly inspiring, as it showed that success is within reach for anyone who is willing to put in the time and effort.
Another thing that impressed me about the lecture was the speaker’s ability to connect with the audience. They were approachable and engaging, and they made sure to involve the audience in the discussion by asking questions and encouraging feedback. This made the experience even more meaningful, as it allowed us to fully participate and feel like we were part of the conversation.
Overall, the lecture was a truly memorable experience, and I came away feeling motivated and inspired. I am grateful for the opportunity to have heard such a talented and passionate speaker, and I know that their words will stay with me for a long time to come. If there is one thing that I took away from this lecture, it is that with hard work, perseverance, and a positive attitude, anything is possible.
居然用英文回我,果然英文比較靈光,大概250字,應該每場演講都能用了XD
來本書籍的好了
我:我閱讀了一本書,請幫我產生一個讀後心得(內容:恭維那本書的心得) 至少400字,有規定心得字數
chatgpt:很抱歉,因為您沒有提到您所閱讀的書名以及題材,我無法幫您產生讀後心得。請提供更多資訊以便我可以更好地幫助您。
看來他不想幫我寫
程式
費氏數列函數
我:give me the code of caculating the value of fibo number (paramater n refer to nth fibo number)
def fibonacci(n): if n <= 0: return 0 elif n == 1: return 1 else: return fibonacci(n-1) + fibonacci(n-2)
裡面有錯字(斜體)他很像也聽得懂
二分搜尋
我:genetate the function written in c++ function as binary search (parameter data( a vector**** unsorted**** ) target(int the target to find in data vector)
#include <vector> int binarySearch(std::vector<int> data, int target) { int low = 0; int high = data.size() - 1; int mid; while (low <= high) { mid = (low + high) / 2; if (data[mid] == target) { return mid; } else if (data[mid] < target) { low = mid + 1; } else { high = mid - 1; } } return -1; }
不過二分搜不是要排序嗎….
不過只是小錯誤而已,對於會的人應該可以自行修正,應該可以明顯提升工程師的效率。