On mind \& Turing's machines (Q885688): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4842677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5704852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paper Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite combinatory processes—formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4793040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3410829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Godel on computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated search for Gödel's proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of Logic Based on Ordinals<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216621 / rank
 
Normal rank

Latest revision as of 10:03, 26 June 2024

scientific article
Language Label Description Also known as
English
On mind \& Turing's machines
scientific article

    Statements

    On mind \& Turing's machines (English)
    0 references
    0 references
    14 June 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    absolutely unsolvable (undecidable)
    0 references
    axiom of infinity
    0 references
    Church's thesis
    0 references
    Diophantine problem
    0 references
    finite machine
    0 references
    general recursive function
    0 references
    mechanical computability
    0 references
    objective mathematics
    0 references
    subjective mathematics
    0 references
    Turing machine
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references