This site uses cookies to improve your experience. To help us insure we adhere to various privacy regulations, please select your country/region of residence. If you do not select a country, we will assume you are from the United States. Select your Cookie Settings or view our Privacy Policy and Terms of Use.
Cookie Settings
Cookies and similar technologies are used on this website for proper function of the website, for tracking performance analytics and for marketing purposes. We and some of our third-party providers may use cookie data for various purposes. Please review the cookie settings below and choose your preference.
Used for the proper function of the website
Used for monitoring website traffic and interactions
Cookie Settings
Cookies and similar technologies are used on this website for proper function of the website, for tracking performance analytics and for marketing purposes. We and some of our third-party providers may use cookie data for various purposes. Please review the cookie settings below and choose your preference.
Strictly Necessary: Used for the proper function of the website
Performance/Analytics: Used for monitoring website traffic and interactions
And, yes, when you try to run the function, it’ll notice it doesn’t have correct arguments and options specified. But what if we ask a question where the answer is some algebraic expression? And, yes, it’s taken a while, but now in Version 13.3 But you’d like to know that what you’re typing isn’t right as soon as you type it.
Events are like functions, whose “arguments” are incoming tokens, and whose output is one or more outgoing tokens. The systems can be based on Boolean algebra, database updating or other kinds of ultimately computational rules. At the level of individual events, ideas from the theory and practice of computation are useful.
Events are like functions, whose “arguments” are incoming tokens, and whose output is one or more outgoing tokens. The systems can be based on Boolean algebra, database updating or other kinds of ultimately computational rules. At the level of individual events, ideas from the theory and practice of computation are useful.
For example, we know (as I discovered in 2000) that (( b · c ) · a ) · ( b · (( b · a ) · b )) = a is the minimal axiom system for Boolean algebra , because FindEquationalProof finds a path that proves it. And we can trace the argument for this to the Principle of Computational Equivalence.
In the end—after all sorts of philosophical arguments, and an analysis of actual historical data —the answer was: “It’s Complicated”. A test example coming soon is whether I can easily explain math ideas like algebra and calculus this way.) Infrageometry—as its name suggests—starts from something lower level than traditional geometry.
Then McCarthy started to explain ways a computer could do algebra. It was all algebra. And the only conclusion we can arrive at is that a person can’t do this much algebra with the hope of getting it right.” Richard Feynman and I would get into very fierce arguments. And he says “There’s a problem. It’s just my nature.
We organize all of the trending information in your field so you don't have to. Join 28,000+ users and stay up to date on the latest articles your peers are reading.
You know about us, now we want to get to know you!
Let's personalize your content
Let's get even more personalized
We recognize your account from another site in our network, please click 'Send Email' below to continue with verifying your account and setting a password.
Let's personalize your content