Description:
Philosophical aspects of Artificial Intelligence.
|
|
|
Is this 3GL or 4GL?
|
| |
casea( A ) :-
less( A , 1 ) ,
write( concat( final , A )) .
casea( A ) :-
less( 1 , A ) ,
write( concat( looping , A )) ,
minus( A , 1 , B ) ,
case( B ) .
------------------
The Output (in PROLOG) for
case(5)
looping5
looping4
looping3
looping2
final1... more »
|
|
*** ROBOT'S 1ST WORDS ***
|
| |
...
You mean the fundamental 'complexity explosion' when expanding AI
applications to work on larger domains is really just an excuse for
"It doesn't work on much!"
Block Prolog will be completed on schedule!
It's now up to proving
DOG+1 is not a NUMBER!
[link]... more »
|
|
The Unsolved Problems web site
|
| |
...
Hi Tim,
I think I solved one!
[link]
Lonely Runner Conjecture
Suppose there are k runners, all lined up at the start of a circular
running track of length 1. They all start running at constant, but
different, speeds.
The Lonely Runner conjecture states that for each runner, there will... more »
|
|
The SUCCESSOR of DOG is NOT a NUMBER!
|
| |
TRACE
nat [ s dog ]?
TRY 1
nat [ s X ]
TAIL 1
nat X
nat dog
FALSE 1
MISMATCH
STACK: 1 - X1 - R - dog
NOT FOUND!
--------
But don't take my word for it!
Consider it FORMALLY PROVEN!
[link]
|
|
Cyber-time, Bit coin exchanges, real-time + traffickiing
|
| |
I'm kinda intrigued by bit-coins rates of exchange for free-hand
sexual services ! thats different to heterosexual intercourse or the
bit-coin rates of exchange to sell a slave like individual for
entertainment unless a demand anywhere in the world for a baby is
lower than for a slug to beg.
I feel thats all very nasty indeed. It also means that theres a... more »
|
|
Smart Computer Trace
|
| |
TRACE
nat [ s X ]?
TRY 1
nat [ s X ]
TAIL 1
nat X
TRY 1
nat 0
STACK: 1 - X - 22 -
STACK: 2 - - 22 - X1
STACK: 3 - X1 - 2 -
STACK: 4 - - 2 - 0
X:=0
----------
The trace is quite effective in color, but I'm
still working on the Recursion Stack..
Herc... more »
|
|
|