Switch to: References

Add citations

You must login to add citations.
  1. Machine Configuration and Word Problems of Given Degree of Unsolvability.J. C. Shepherdson - 1965 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (2):149-175.
  • Machine Configuration and Word Problems of Given Degree of Unsolvability.J. C. Shepherdson - 1965 - Mathematical Logic Quarterly 11 (2):149-175.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  • The Halting Problem of one State Turing Machines with n‐Dimensional Tape.G. T. Herman - 1968 - Mathematical Logic Quarterly 14 (7‐12):185-191.
  • The Halting Problem of one State Turing Machines with n‐Dimensional Tape.G. T. Herman - 1968 - Mathematical Logic Quarterly 14 (7-12):185-191.
  • A computational complexity approach to the definition of empirical equivalence.Doriano Brogioli - unknown
    I propose to investigate the problem of empirical equivalence by performing numerical calculations, simulating hypothetical physical systems, with known evolution rules, which include a robot performing an experiment. The aim of the experiments of the robot is to discover the rules governing the system in which it is simulated. The proposed numerical calculation is actually a thought experiment: I discuss the principles of how the discussion on the empirical equivalence should be performed; the discussion is based on the evaluation of (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark