[ home ] [ math / cs / ai / phy / as / chem / bio / geo ] [ civ / aero / mech / ee / hdl / os / dev / web / app / sys / net / sec ] [ med / fin / psy / soc / his / lit / lin / phi / arch ] [ off / vg / jp / 2hu / tc / ts / adv / hr / meta / tex ] [ chat ] [ wiki ]

/cs/ - Computer Science


Name
Email
Subject
Comment
Verification
Instructions:
  • Press the Get Captcha button to get a new captcha
  • Find the correct answer and type the key in TYPE CAPTCHA HERE
  • Press the Publish button to make a post
  • Incorrect answer to the captcha will result in an immediate ban.
File
Password (For file deletion.)

25 Dec 2021Mathchan is launched into public

11 / 1 / 9 / ?

File: IMG_3828.jpg ( 1.52 MB , 3024x4032 , 1707016575519.jpg )

Image
In my downtime, I'm writing a CAS in Python. It has to be from scratch, because I want it to fit on my calculator, and all of the solutions out there import a lot of data. Currently, there are two separate programs, one which can do full polynomial arithmetic, but you have to type in the polynomial in program form, as a list of coefficients starting from x^0. I'm working on merging it with the CAS interface, which will evaluate expressions recursively. For example: (sin x)^2 is sin inputted into the function f(y) = y^2. Though I don't have time to make this logic perfect, it will be interesting to learn how to program a u-substitution for arbitrary input.
>>
>>160
Will be interesting when this makes a TI-84 a TI-89 lol
>>
>>161
test
>>
>>160

Is this possible to do with TI-Basic?
>>
>>165
I mean, TI-Basic is turing complete I believe, so yea theoretically yes. Through practically I doubt you can get enough memory lol
>>
>>161
That's not really the point. I want to learn how a CAS works, particularly in solving more difficult diffiques
>>
>>167
diffiques?
>>
did I make it?
>>
>>160
nnn
>>
>>163
>test
>>
>>163
2
>>
sd