omitir hasta el contenido
New proofs of old theorems in logic and formal linguistics. Ver este material de antemano
CerrarVer este material de antemano
Chequeando…

New proofs of old theorems in logic and formal linguistics.

Autor: Robert W Floyd; CARNEGIE INST OF TECH PITTSBURGH PA.
Editorial: Ft. Belvoir Defense Technical Information Center NOV 1966.
Edición/Formato:   Libro impreso : Inglés (eng)Ver todas las ediciones y todos los formatos
Resumen:
Theorem 1 constructs, from any word problem in a semi-Thue system, an equivalent Post correspondence problem, showing the undecidability of the general Post correspondence problem. Theorem 2 constructs, from any Post correspondence problem, a minimal linear grammar which is ambiguous exactly if the Post correspondence problem has a solution, showing the undecidability of the general ambiguity problem. (Other  Leer más
Calificación:

(todavía no calificado) 0 con reseñas - Ser el primero.

Temas
Más materiales como éste

 

Encontrar un ejemplar en la biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que tienen este material…

Detalles

Tipo de documento Libro
Todos autores / colaboradores: Robert W Floyd; CARNEGIE INST OF TECH PITTSBURGH PA.
Número OCLC: 227469361
Notas: Prepared in cooperation with Computer Associates, Inc., Auburn, Mass., Contract AF 30(602)-3342.
Descripción: 19 pages

Resumen:

Theorem 1 constructs, from any word problem in a semi-Thue system, an equivalent Post correspondence problem, showing the undecidability of the general Post correspondence problem. Theorem 2 constructs, from any Post correspondence problem, a minimal linear grammar which is ambiguous exactly if the Post correspondence problem has a solution, showing the undecidability of the general ambiguity problem. (Other standard undecidability results on phrase structure grammars are implied.) Theorem 3 constructs, from any word problem in a semi-Thue system, an ambiguity problem, combining the results of Theorem 1 and 2 by more direct means. No new results are presented, but standard proofs were shortened and constructions eliminated, combined, or simplified. (Author).

Reseñas

Reseñas contribuidas por usuarios
Recuperando reseñas de GoodReads…
Recuperando reseñas de DOGObooks…

Etiquetas

Ser el primero.

Materiales similares

Confirmar este pedido

Ya ha pedido este material. Escoja OK si desea procesar el pedido de todos modos.

Datos enlazados


Primary Entity

<http://www.worldcat.org/oclc/227469361> # New proofs of old theorems in logic and formal linguistics.
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "227469361" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/vau> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/47434171#Place/ft_belvoir> ; # Ft. Belvoir
   schema:about <http://experiment.worldcat.org/entity/work/data/47434171#Topic/linguistics> ; # Linguistics
   schema:about <http://experiment.worldcat.org/entity/work/data/47434171#Topic/theorems> ; # Theorems)
   schema:about <http://experiment.worldcat.org/entity/work/data/47434171#Topic/grammars> ; # Grammars
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/47434171#Organization/carnegie_inst_of_tech_pittsburgh_pa> ; # CARNEGIE INST OF TECH PITTSBURGH PA.
   schema:contributor <http://viaf.org/viaf/9939181> ; # Robert W. Floyd
   schema:datePublished "NOV 1966" ;
   schema:datePublished "1966" ;
   schema:description "Theorem 1 constructs, from any word problem in a semi-Thue system, an equivalent Post correspondence problem, showing the undecidability of the general Post correspondence problem. Theorem 2 constructs, from any Post correspondence problem, a minimal linear grammar which is ambiguous exactly if the Post correspondence problem has a solution, showing the undecidability of the general ambiguity problem. (Other standard undecidability results on phrase structure grammars are implied.) Theorem 3 constructs, from any word problem in a semi-Thue system, an ambiguity problem, combining the results of Theorem 1 and 2 by more direct means. No new results are presented, but standard proofs were shortened and constructions eliminated, combined, or simplified. (Author)."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/47434171> ;
   schema:inLanguage "en" ;
   schema:name "New proofs of old theorems in logic and formal linguistics."@en ;
   schema:productID "227469361" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/227469361#PublicationEvent/ft_belvoirdefense_technical_information_centernov_1966> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/47434171#Agent/defense_technical_information_center> ; # Defense Technical Information Center
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/227469361> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/47434171#Agent/defense_technical_information_center> # Defense Technical Information Center
    a bgn:Agent ;
   schema:name "Defense Technical Information Center" ;
    .

<http://experiment.worldcat.org/entity/work/data/47434171#Organization/carnegie_inst_of_tech_pittsburgh_pa> # CARNEGIE INST OF TECH PITTSBURGH PA.
    a schema:Organization ;
   schema:name "CARNEGIE INST OF TECH PITTSBURGH PA." ;
    .

<http://experiment.worldcat.org/entity/work/data/47434171#Topic/linguistics> # Linguistics
    a schema:Intangible ;
   schema:name "Linguistics"@en ;
   schema:name "(Linguistics"@en ;
    .

<http://viaf.org/viaf/9939181> # Robert W. Floyd
    a schema:Person ;
   schema:familyName "Floyd" ;
   schema:givenName "Robert W." ;
   schema:name "Robert W. Floyd" ;
    .


Content-negotiable representations

Cerrar ventana

Inicie una sesión con WorldCat 

¿No tienes una cuenta? Puede fácilmente crear una cuenta gratuita.