View in EDS PDF Full Text

Commentary on Bringsjord on P = NP.

Saved in:
Bibliographic Details
Title: Commentary on Bringsjord on P = NP.
Source: Minds & Machines. Dec2017, Vol. 27 Issue 4, p673-678. 6p.
Subjects: Physical cosmology, Problem solving methodology, Physical networks (Polymers), Digital computer simulation, Turing machines
Abstract: The article presents an argument that the existence of a physical process that can solve a problem in a polynomial number of macroscopic steps does not entail the existence of a Turing machine, physical or abstract, that can solve the same problem in a polynomial number of read/write tape moves, even if we grant digital physics. The argument is supported by Barcan Formula.
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 126586379
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Commentary on Bringsjord on P = NP.
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Minds+%26+Machines%22">Minds & Machines</searchLink>. Dec2017, Vol. 27 Issue 4, p673-678. 6p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Physical+cosmology%22">Physical cosmology</searchLink><br /><searchLink fieldCode="DE" term="%22Problem+solving+methodology%22">Problem solving methodology</searchLink><br /><searchLink fieldCode="DE" term="%22Physical+networks+%28Polymers%29%22">Physical networks (Polymers)</searchLink><br /><searchLink fieldCode="DE" term="%22Digital+computer+simulation%22">Digital computer simulation</searchLink><br /><searchLink fieldCode="DE" term="%22Turing+machines%22">Turing machines</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The article presents an argument that the existence of a physical process that can solve a problem in a polynomial number of macroscopic steps does not entail the existence of a Turing machine, physical or abstract, that can solve the same problem in a polynomial number of read/write tape moves, even if we grant digital physics. The argument is supported by Barcan Formula.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=126586379
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s11023-017-9452-3
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 6
        StartPage: 673
    Subjects:
      – SubjectFull: Physical cosmology
        Type: general
      – SubjectFull: Problem solving methodology
        Type: general
      – SubjectFull: Physical networks (Polymers)
        Type: general
      – SubjectFull: Digital computer simulation
        Type: general
      – SubjectFull: Turing machines
        Type: general
    Titles:
      – TitleFull: Commentary on Bringsjord on P = NP.
        Type: main
  BibRelationships:
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 12
              Text: Dec2017
              Type: published
              Y: 2017
          Identifiers:
            – Type: issn-print
              Value: 09246495
          Numbering:
            – Type: volume
              Value: 27
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Minds & Machines
              Type: main
ResultId 1