(no title)
aeneasmackenzie | 19 days ago
Formal reasoning is so powerful you can pretend these things actually exist, but they don’t!
I see you are already familiar with subcountability so you know the rest.
aeneasmackenzie | 19 days ago
Formal reasoning is so powerful you can pretend these things actually exist, but they don’t!
I see you are already familiar with subcountability so you know the rest.
foxes|19 days ago
Doesn't that formal string of symbols exist?
Seems like allowing formal string of symbols that don't necessarily "exist" (or well useful for physics) can still lead you to something computable at the end of the day?
Like a meta version of what happens in programming - people often start with "infinite" objects eg `cycle [0,1] = [0,1,0,1...]` but then extract something finite out of it.
aeneasmackenzie|18 days ago
List functions like that need to be handled carefully to ensure termination. Summations of infinite series deal are a better example, consider adding up a geometric series. You need to add “all” the terms to get the correct result.
Of course you don’t actually add all the terms, you use algebra to determine a value.