Funny Pics
-
wrote on 13 May 2023, 19:16 last edited by
-
wrote on 13 May 2023, 20:46 last edited by
-
wrote on 14 May 2023, 03:26 last edited by
-
wrote on 14 May 2023, 13:58 last edited by
-
wrote on 15 May 2023, 13:19 last edited by
Can you believe this ad?
-
wrote on 15 May 2023, 13:37 last edited by
That poor guy would be plumb worn out.
-
wrote on 15 May 2023, 13:42 last edited by
-
wrote on 15 May 2023, 14:08 last edited by
-
wrote on 15 May 2023, 14:41 last edited by
-
wrote on 16 May 2023, 13:24 last edited by
I guess trump was right
-
wrote on 16 May 2023, 13:44 last edited by
That seals it.
-
wrote on 16 May 2023, 13:54 last edited by
-
wrote on 16 May 2023, 18:29 last edited by
-
wrote on 16 May 2023, 18:46 last edited by
Larry as a child; meeting new people, making new friends.
-
wrote on 16 May 2023, 18:46 last edited by
-
wrote on 17 May 2023, 01:32 last edited by
-
wrote on 17 May 2023, 13:38 last edited by
-
wrote on 17 May 2023, 15:03 last edited by
@bachophile said in Funny Pics:
A pair of a pair of scissors.
(I'll leave it to @Klaus to create further recursions or perhaps even a pair of scissors mobius loop.)
-
@bachophile said in Funny Pics:
A pair of a pair of scissors.
(I'll leave it to @Klaus to create further recursions or perhaps even a pair of scissors mobius loop.)
wrote on 17 May 2023, 15:06 last edited by Klaus@Aqua-Letifer said in Funny Pics:
(I'll leave it to @Klaus to create further recursions or perhaps even a pair of scissors mobius loop.)
One of the earliest (1950s) cool programming languages, LISP, was built in a very fundamental way on a pair data structure, which was often very deeply and recursively nested to create, for instance, arbitrarily large lists of things.
-
@Aqua-Letifer said in Funny Pics:
(I'll leave it to @Klaus to create further recursions or perhaps even a pair of scissors mobius loop.)
One of the earliest (1950s) cool programming languages, LISP, was built in a very fundamental way on a pair data structure, which was often very deeply and recursively nested to create, for instance, arbitrarily large lists of things.
wrote on 17 May 2023, 15:53 last edited by@Klaus said in Funny Pics:
@Aqua-Letifer said in Funny Pics:
(I'll leave it to @Klaus to create further recursions or perhaps even a pair of scissors mobius loop.)
One of the earliest (1950s) cool programming languages, LISP, was built in a very fundamental way on a pair data structure, which was often very deeply and recursively nested to create, for instance, arbitrarily large lists of things.
I'm glad to see I was not disappointed.
And indeed, recursions are fun.