A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Random-Walk Calculations in Intermetallic Compounds
2005
Defect and Diffusion Forum
Preserved Fulltext
Unsolved problems are highlighted. ...
It is emphasized how analytical development is especially enhanced when Monte Carlo computer simulation is done in parallel. ...
Unsolved problems are highlighted. ...
doi:10.4028/www.scientific.net/ddf.237-240.291
fatcat:kcs27drwoza5tlu26qiai4lpu4
Two-Coordinate Magnesium(I) Dimers Stabilized by Super Bulky Amido Ligands
2016
Angewandte Chemie
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
THF adducts of two of these complexes are also reported. ...
LMg-MgL (L= -N(Ar)(SiR 3 ); Ar = C 6 H 2 {C(H)Ph 2 } 2 R'-2,6,4; R = Me, Pr i or Ph; R' = Pr i or Me), which crystallographic and DFT computational studies show to possess unsupported Mg-Mg covalent bonds ...
The structure of one of these complexes (7) is depicted in Figure 2 , as this represents the first example of a crystallographically characterized unsolvated monodentate amido magnesium halide complex ...
doi:10.1002/ange.201604362
fatcat:sgpmj7ijrffnberiytmm3p7cse
Page 4892 of Mathematical Reviews Vol. , Issue 88i
[page]
1988
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(German) [Computability, complexity, logic] Eine Einfihrung in Algorithmen, Sprachen und Kalkile unter besonderer Bericksichtigung ihrer Komplexitat. ...
ISBN 90-277-2146-7 This book is aimed at assembling in one place all the significant facts known about a considerable area of complexity theory, pack- ing theorems, often consisting of several parts, at ...
Page 2421 of Mathematical Reviews Vol. , Issue 2000d
[page]
2000
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Barendregt [in Handbook of logic in computer science, Vol. 2, 117-309, Oxford Univ. Press, New York, 1992; MR 97m:03026]. ...
These features considerably facilitate the metatheoretical study and fur- ther extension of this system.” ...
Digital Systems Simulation
1975
Computer
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
On the basis of these considerations, this issue of Computer looks at the basic concepts and models used for digital logic simulators, and also considers implementation March 1975 ...
If one anticipates future trends in technology, then the problems remaining to be solved increase considerably. ...
However, it uses considerably different techniques from those used in parallel simulators. ...
doi:10.1109/c-m.1975.218897
fatcat:y5wdioqflzeyjjrmzqevnqllym
Open Issues and Opportunities in Web Services Modeling, Development, and Management
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
For example, Web services are typically used to integrate complex systems and not to perform simple computations. ...
Aside from considerations related to the young age of the technology, the interesting aspect of Web services is that they have characteristics that differ from services in conventional middleware, and ...
For example, Web services are typically used to integrate complex systems and not to perform simple computations. ...
doi:10.1007/978-3-540-24634-3_2
fatcat:d7rwg7z7kzaspgnjsvdixtvtzm
Noncomputability, unpredictability, undecidability, and unsolvability in economic and finance theories
2012
Complexity
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We outline, briefly, the role that issues of the nexus between noncomputability and unpredictability, on the one hand, and between undecidability and unsolvability, on the other, have played in Computable ...
The inspiration for this outline was provided by Professor Garça's thought-provoking recent article in this Journal. 2 ...
economics (1977) and the Turing Prize (1975), awarded by the ACM. 5 Decision problems in the strict sense of metamathematics and, hence, leading to the modern framework of computational complexity theory ...
doi:10.1002/cplx.21410
fatcat:n3ny37cyqvbrnp4zdli4s4yob4
Page 843 of Neural Computation Vol. 6, Issue 5
[page]
1994
Neural Computation
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
functions to each computational node in the network that can potentially affect the given output). ...
This theory takes into consideration the complexity issues of learning and general- ization from examples, from the general artificial intelligence point of view. ...
Computing the Busy Beaver Function
[chapter]
1987
Open Problems in Communication and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Efforts to calculate values of the noncomputable Busy Beaver function are discussed in the light of algorithmic information theory. ...
The Busy Beaver function is also of considerable metamathematical interest; in principle it would be extremely useful to know larger values of Σ(n). ...
In fact, it is not difficult to see that Σ(n) is greater than the computable function f (n) as soon as n is greater than (the program-size complexity or algorithmic information content of f ) + O (1) ...
doi:10.1007/978-1-4612-4808-8_28
fatcat:4c32kcvfh5exdi5pts662sm7q4
Degrees of Unsolvability: A Tutorial
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Given a problem P , one associates to P a degree of unsolvability, i.e., a quantity which measures the amount of algorithmic unsolvability which is inherent in P . ...
We feel that, among various interpretations of intuitionistic mathematics, our interpretation in terms of the Muchnik topos stands out because of its relationship to the ideas of Kolmogorov, Medvedev, ...
Accordingly, a mass problem P is said to be unsolvable if it contains no Turing computable real, i.e., if P ∩ REC = ∅ where REC = {X | X is computable}. ...
doi:10.1007/978-3-319-20028-6_9
fatcat:l52kiot3y5dafoqwsgp5s3d4ta
Page 32 of Executive Vol. 7, Issue 1
[page]
1963
Executive
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Computer models can be employed by nonmathematical analysts, thereby widening their effectiveness in the study of complex social systems. 5. ...
Computer models, unlike mathematical models requiring analytical solutions, en¬ courage the use of complex, nonlinear relations. ...
Key-agreement based on automaton groups
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
key-agreement platforms for Anshl-Anshel-Goldfeld metascheme, they include Grigorchuk and universal Grigorchuk groups, Hanoi 3-Towers group, Basilica group and a subgroup of the affine group with the unsolvable ...
Collaboration Grant 527814, is partially supported by the mega-grant of the Russian Federation Government (N14.W03.31.0030) and is grateful to Max-Planck Institut fuer Mathematik, Bonn during staying in ...
Observe that the word problem in G ω has a complexity upper bound polynomial in the complexity of computing a prefix of ω of a logarithmic length, while for a generic ω already the single conjugacy equation ...
arXiv:1905.03124v1
fatcat:ionugguliba4zhwlt22vcb5imq
Parallel Marker-Based Image Segmentation with Watershed Transformation
1998
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
parallel algorithm are worth of mentioning: the local detection of the catchment basins conforming the watershed principle (which strongly depends on the history of the regions' growth); and the parallel computation ...
In a hybrid fashion, pixels are rst clustered based on spatial proximity and graylevel homogeneity with the watershed transformation. ...
This is not only memory cumbersome, but it also considerably increases the complexity of FindMin* function. ...
doi:10.1006/jpdc.1998.1448
fatcat:apibmzoxpjbx7axbooso7ppisa
Quantum Materials for Energy-Efficient Computing
2020
JOM: The Member Journal of TMS
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Recent advancements in experimental tools, computational methods, computing power, and materials informatics present us with an exciting opportunity to predictively discover and design materials for a ...
playing a pivotal role in developing a fundamental microscopic understanding of complex phenomena, and in the discovery and design of a number of quantum materials for energy applications. ...
playing a pivotal role in developing a fundamental microscopic understanding of complex phenomena, and in the discovery and design of a number of quantum materials for energy applications. ...
doi:10.1007/s11837-020-04293-3
fatcat:dhltfgjifjclrf2nrqso7xqsrm
The Complexity of Goldbach's Conjecture
2020
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In computational complexity theory, another major complexity class is ASPACE(S(n)) for some S(n). It is known that ASPACE(log n) = P. ...
On the other hand, P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? ...
The P versus N P problem is the major unsolved problem in computer science [1] . This is considered by many to be the most important open problem in the field [1] . ...
doi:10.5281/zenodo.3648512
fatcat:jv3iw3knejfvrnr2efsb3ctaai
« Previous
Showing results 1 — 15 out of 43,948 results