A Note on Square Rooting of Time Functions of Turing Machines.
Saved in:
| Title: | A Note on Square Rooting of Time Functions of Turing Machines. |
|---|---|
| Authors: | Lipton, Richard J., Ogihara, Mitsunori, Zalcstein, Yechezkel |
| Source: | Theory of Computing Systems. May2003, Vol. 36 Issue 3, p295. 5p. |
| Subjects: | Machine theory, Square root, Mathematical functions, Mathematics |
| Abstract: | This article focuses on square rooting of time functions of Turning machines. It studies the conjecture that for all nondeterministic time functions T the square root of T is equivalent to the time function of a nondeterministic Turning machines. Mathematical studies show that deterministic version of this conjecture is false. |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 9584964 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A Note on Square Rooting of Time Functions of Turing Machines. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Lipton%2C+Richard+J%2E%22">Lipton, Richard J.</searchLink><br /><searchLink fieldCode="AR" term="%22Ogihara%2C+Mitsunori%22">Ogihara, Mitsunori</searchLink><br /><searchLink fieldCode="AR" term="%22Zalcstein%2C+Yechezkel%22">Zalcstein, Yechezkel</searchLink> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Theory+of+Computing+Systems%22">Theory of Computing Systems</searchLink>. May2003, Vol. 36 Issue 3, p295. 5p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Machine+theory%22">Machine theory</searchLink><br /><searchLink fieldCode="DE" term="%22Square+root%22">Square root</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+functions%22">Mathematical functions</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematics%22">Mathematics</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: This article focuses on square rooting of time functions of Turning machines. It studies the conjecture that for all nondeterministic time functions T the square root of T is equivalent to the time function of a nondeterministic Turning machines. Mathematical studies show that deterministic version of this conjecture is false. |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=9584964 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s00224-002-1079-x Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 5 StartPage: 295 Subjects: – SubjectFull: Machine theory Type: general – SubjectFull: Square root Type: general – SubjectFull: Mathematical functions Type: general – SubjectFull: Mathematics Type: general Titles: – TitleFull: A Note on Square Rooting of Time Functions of Turing Machines. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Lipton, Richard J. – PersonEntity: Name: NameFull: Ogihara, Mitsunori – PersonEntity: Name: NameFull: Zalcstein, Yechezkel IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 05 Text: May2003 Type: published Y: 2003 Identifiers: – Type: issn-print Value: 14324350 Numbering: – Type: volume Value: 36 – Type: issue Value: 3 Titles: – TitleFull: Theory of Computing Systems Type: main |
| ResultId | 1 |