Conversation started Sep 23, 2023 at 12:38.
The Empty String Photographer
The Empty String Photographer
Sep 23, 2023 12:38
CUC (Chat Unclear Challenge): Make a quine that runs in polynomial time.
mousetail
mousetail
Sep 23, 2023 12:55
what is N?
Does O(1) count as polinominal?
The Empty String Photographer
The Empty String Photographer
@mousetail I guess :p
mousetail
mousetail
Then any quine would count
The Empty String Photographer
The Empty String Photographer
It’s the polynomial n^0
mousetail
mousetail
Quines take no input so can't take any other amount of time
The Empty String Photographer
The Empty String Photographer
@mousetail hence why it’s CUC
mousetail
mousetail
Sep 23, 2023 13:00
I don't think there should ever be another CUC
Even the acronym is unfortunate
And how is anyone supposed to answer a challenge that is unclear?
The Empty String Photographer
The Empty String Photographer
CFC (Chat Funny Challenge or Chlorofluorocarbon): Make any algorithm that runs in O(2) time.
Simd
Simd
@TheEmptyStringPhotographer 1
That's in python
The Empty String Photographer
The Empty String Photographer
@Simd Nope. O(2) algorithms must run two times slower than O(1) algorithms :p
lyxal
lyxal
I feel like that may not be how O(1) works :p
math scat
math scat
^ lol
The Empty String Photographer
The Empty String Photographer
Sep 23, 2023 13:06
@lyxal Note the :p :p
math scat
math scat
oh :P
The Empty String Photographer
The Empty String Photographer
q:
I have two tongues q:p
bq funny letters
mousetail
mousetail
@TheEmptyStringPhotographer There is no such thing, google big O notation
lyxal
lyxal
holy time complexity
mousetail
mousetail
Actual omega
math scat
math scat
Sep 23, 2023 13:20
new time complexity just dropped
lyxal
lyxal
call the polynomial time algorithm
 
Conversation ended Sep 23, 2023 at 13:20.