« first day (1884 days earlier)      last day (947 days later) » 

user76284
user76284
12:01 AM
Ah, y∉Y.
 
 
3 hours later…
Amr
Amr
3:01 AM
Hello again.
In finitist mathematics , is the question "let P be some computer program, Does computer program P halt ?" accepted as a meaningful question within finitist mathematics ?
 
 
4 hours later…
user21820
user21820
7:30 AM
@user76284 Exactly. =)
@Amr Depends on what you mean by "finitist". You might want to read this:
35
A: Are sets and symbols the building blocks of mathematics?

user21820The things you actually write on the paper or some other medium are not definable as any kind of mathematical objects. Mathematical structures can at most be used to model (or approximate) the real world structures. For example we might say that we can have strings of symbols of arbitrary length,...

 
 
14 hours later…
Lereau
Lereau
9:26 PM
Ehr am I really missing something here? math.stackexchange.com/a/4276863/351999
 
Amr
Amr
10:16 PM
59359442 Thanks for the comprehensive answer.
59359442 I looked up wikipedia and found out two formal systems associated with finitism : Skolem's primitive recursive arithmetic and elementary function arithmetic. Normally, I would guess that these two formal systems can prove the statements after possibly some translation between the two languages, however wikipedia seems to suggest that this is not true by saying that they have different proof theoretic ordinals (I don't what that means :))
however wikipedia seems to suggest that this is not true by saying that they have different proof theoretic ordinals (I don't what that means :) ). Anyway, it seems that in both of these formal systems one can't discuss the question whether an arbitrary computer program will halt or not , no ?
Does this chat box room has a word have a limit on the number of characters ?so ridiculous:(
 

« first day (1884 days earlier)      last day (947 days later) »