and Scheme and I
put that project to one side.
Hill
On Sat, Apr 13, 2024 at 8:54 PM Dima Pasechnik wrote:
>
>
> On 13 April 2024 02:38:34 CEST, Hill Strong
> wrote:
> >There is nothing to stop anyone from breaking the requirement of using any
> >Lisp as the destination for Boo
There is nothing to stop anyone from breaking the requirement of using any
Lisp as the destination for Boot code. I translated one section of Boot
code directly into Icon. Of course there is much in Boot than assumes Lisp
lists. But that is not an impossible task to change.
You could then use the
On Thu, Mar 28, 2024 at 6:02 PM Ralf Hemmecke wrote:
>
>
> OK the answer to the above is not soo important to me, but I think Greg
> is right that the builtin 'error' should automatically show the function
> name in which it is called. Doesn't the compiler have all this information?
>
> Such an
nt knowledge to really suggest what should be
>> appropriate here. But we can at least open the discussion to what might be
>> suitable.
>>
>> Hill
>>
>> On Tue, Mar 5, 2024 at 4:39 PM Hill Strong wrote:
>>
>>> Ralf,
>>>
>>> Afte
: Operator(*,+) Variables(a,b,c) == a*(b+c) <-> a*b
+ a*c
Axiom CharacteristicZero : Characteristic(0)
I do not have sufficient knowledge to really suggest what should be
appropriate here. But we can at least open the discussion to what might be
suitable.
Hill
On Tue, Mar 5, 2024 at 4:39 P
Ralf,
After reading and digesting both Waldek's and your responses, my view is
that the FriCAS language is conflating a number of ideas into a single
syntactic structure.
Looking through the source code available, there are various [properties]
that are being defined automatically under some
Good morning Ralf,
On Thu, Feb 22, 2024 at 7:56 AM Ralf Hemmecke wrote:
> On 2/21/24 21:23, Hill Strong wrote:
> > Good morning Ralf,
> >
> > On Thu, Feb 22, 2024 at 4:49 AM Ralf Hemmecke wrote:
> >
> >> [Remove ...]
> >> Suppose there a
Good morning Ralf,
On Thu, Feb 22, 2024 at 4:49 AM Ralf Hemmecke wrote:
> [Remove ...]
> Suppose there are two categories CatA and CatB and we define
>
> CatAB: Category == Join(CatA, CatB)
>
> You know that there is a little difference between
>
> FooJ(D): Export == Implementation where
>
be FiniteLinearAggregateFunctions2.
When I see this in code bases, it is an indicator that this should be
looked at and fixed appropriately.
Hill
On Thu, Feb 22, 2024 at 2:23 AM Ralf Hemmecke wrote:
> On 2/21/24 15:46, Hill Strong wrote:
> > I have quite a few places in the FriCAS so
I have quite a few places in the FriCAS source code the following
Join(SemiRng, AbelianMonoid)
What would you call this particular algebraic structure?
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from
finition for n has already set this
value to r.logLen.
I can, if anyone is interested, create a pull request to remove this
specific line from the definition.
Hill Strong
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To un
t;The Emotion Machine" ...
>>>> described
>>>> words such as "emotions," "memory," "thinking" and "intelligence" as
>>>> suitcase
>>>> words - words that mean "*nothing by itself, but holds a
;intelligence" as
>> suitcase
>> words - words that mean "*nothing by itself, but holds a bunch of things
>> inside *
>> *that you have to unpack*."
>>
>> On Wednesday, January 17, 2024 at 10:03:53 PM UTC-5 elders...@gmail.com
>> wrote:
>
"*nothing by itself, but holds a bunch of things
> inside *
> *that you have to unpack*."
>
> On Wednesday, January 17, 2024 at 10:03:53 PM UTC-5 elders...@gmail.com
> wrote:
>
>> Good morning Waldek,
>>
>> My response will be delving into some areas of philosophical
Good morning Waldek,
My response will be delving into some areas of philosophical and
metaphysical response.
On Thu, Jan 18, 2024 at 2:56 AM Waldek Hebisch wrote:
> On Thu, Jan 18, 2024 at 01:16:55AM +1100, Hill Strong wrote:
> > On Wed, Jan 17, 2024 at 11:09 PM Tim Da
uter algebra is aligning LEAN's axiom
>>>>> structure with our category/domain structure (my current research).
>>>>> Once that is done then theorems, such as a commutative theorem,
>>>>> can be inherited and available to prove a function in a domain.
>&
ecause we are strongly typed and use a group theory scaffold we
>>> are in a unique position to formalize our algorithms.
>>>
>>> The combination of proof systems and computer algebra will be a
>>> large step in computational mathematics.
>>>
>>> T
and computer algebra will be a
> large step in computational mathematics.
>
> Tim
>
>
> [0] Bellman Equation
> https://en.wikipedia.org/wiki/Bellman_equation
>
> [1] Connecting Gröbner Bases Programs with Coq to do Proofs in Algebra,
> Geometry and Arithmetics
> https:
Agreed, not new at all. The Forbin Project
On Tue, 16 Jan 2024, 10:59 am Dima Pasechnik, wrote:
> On Mon, Jan 15, 2024 at 10:45 PM Hill Strong
> wrote:
> >
> > No artificial stupidity (AI) will ever or should ever be considered as
> [a trustworthy co-author in mathematic
No artificial stupidity (AI) will ever or should ever be considered as [a
trustworthy co-author in mathematical research]. At best, these systems
could be a possibly useful tool in the hands of those who know their
subject field. In the hands of everyone else they will be like young
children using
There is a simple fix to this problem.
Create a stack onto which you push a copy of the current dynamic variables
that you want to keep just before you do the recursive call and restore
those dynamic variables immediately after the recursive call finishes.
The best place for this code is in a
On Fri, Dec 8, 2023 at 11:47 AM Waldek Hebisch wrote:
> On Fri, Dec 08, 2023 at 10:50:13AM +1100, Hill Strong wrote:
> > If the daase is so small that it only takes 23 Mbytes to load into
> memory,
> > it would be worth it if it took 100 Mbytes to load into memory. How many
>
laptop.
The question to ask is: why has this not been done sooner?
regards to all
Hill Strong.
On Fri, Dec 8, 2023 at 1:45 AM Qian Yun wrote:
> I did some experiments on putting daase into memory instead of disk.
>
> For the 8.5MB interp.daase, load it into memory takes 23MB:
>
Good evening Tim,
I will set up a github repository in the near future (in the next couple of
months) and let you know when it is ready for any comments (including any
negative) as there will be things I won't have seen.
On Fri, Nov 10, 2023 at 5:04 PM Tim Daly wrote:
> Hill Strong wri
On Thu, Nov 9, 2023 at 12:38 AM Waldek Hebisch wrote:
> On Wed, Nov 08, 2023 at 05:29:38PM +1100, Hill Strong wrote:
> >
> > On Wed, 8 Nov 2023, 2:28 pm Waldek Hebisch, wrote:
> >
> > > On Wed, Nov 08, 2023 at 11:51:12AM +1100, Hill Strong wrote:
> &g
Comments below.
On Wed, 8 Nov 2023, 2:28 pm Waldek Hebisch, wrote:
> On Wed, Nov 08, 2023 at 11:51:12AM +1100, Hill Strong wrote:
> > In terms of defining any kind of variable, the language and its
> associated
> > semantics should have a [bottom] value. Interestingly
In terms of defining any kind of variable, the language and its associated
semantics should have a [bottom] value. Interestingly, FriCAS does have
such a value defined. However, what is not clear is whether this [bottom]
can serve for all domains.
There are a couple of alternatives here. One is
to look at and
use if they want.
regards and blessings to you and your family
Hill Strong
On Saturday, October 30, 2021 at 9:12:52 PM UTC+11 ra...@hemmecke.org wrote:
> Hi,
>
> > The current BOOT code is, for the most part, able to be rewritten in
> > a language called Icon
other people, I can now devote my time into
this area.
At any rate, may you and your family be blessed in these interesting times.
regards
Hill Strong
On Monday, October 11, 2021 at 8:11:10 PM UTC+11 ra...@hemmecke.org wrote:
> Hi,
>
> > I was looking at reimplementing the bo
))
(print l2)
(rplacd (cdr l2) (car l1))
(print l2)
(rplacd l2 (cdr l1))
(print l2)
and I get the results
(A B C D E)
(K L M N O)
(K L . A)
(K B C D E)
Is this the expected results or is something else actually expected?
greetings
Hill Strong
--
You received this message because you
30 matches
Mail list logo
