How We Think of Computing Today (Q3507474): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4321931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Turing computations via Malament--Hogarth space-times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines, transition systems, and interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines that take advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem / 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: Q2762165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4803420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Interactive Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory Is Forever / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129003 / rank
 
Normal rank

Latest revision as of 12:24, 28 June 2024

scientific article
Language Label Description Also known as
English
How We Think of Computing Today
scientific article

    Statements

    How We Think of Computing Today (English)
    0 references
    0 references
    0 references
    19 June 2008
    0 references
    0 references
    Turing machines
    0 references
    evolving automata
    0 references
    interactive computation
    0 references
    non-uniform complexity
    0 references
    0 references